Wiretap lattice codes from number fields with no small norm elements

We consider the problem of designing reliable and confidential lattice codes, known as wiretap lattice codes, for fast fading channels. We identify as code design criterion for finite lattice constellations a finite sum of inverse of algebraic norms, in fact the analogous for finite sums of the known criterion for infinite constellations, which motivates us to study totally real number fields with few elements of small norms, over which ideal lattices can be built to provide wiretap lattice codes. More precisely, we first narrow down our search to Abelian number fields known to provide reliable lattice codes, among which we look for no small inert primes and large regulators.     

On self-dual cyclic codes over finite chain rings

In this paper, we give necessary and sufficient conditions for the existence of non-trivial cyclic self-dual codes over finite chain rings. We prove that there are no free cyclic self-dual codes over finite chain rings with odd characteristic. It is also proven that a self-dual code over a finite chain ring cannot be the lift of a binary cyclic self-dual code. The number of cyclic self-dual codes over chain rings is also investigated as an extension of the number of cyclic self-dual codes over finite fields given recently by Jia et al.     

Affine cartesian codes

We compute the basic parameters (dimension, length, minimum distance) of affine evaluation codes defined on a cartesian product of finite sets. Given a sequence of positive integers, we construct an evaluation code, over a degenerate torus, with prescribed parameters of a certain type. As an application of our results, we recover the formulas for the minimum distance of various families of evaluation codes.     

Inter-comparison and validation of computational fluid dynamics codes in two-stage meandering channel flows

This paper presents a study in the inter-comparison and validation of three-dimensional computational fluid dynamics codes which are currently used in river engineering. Finite volume codes PHOENICS, FLUENT and SSIIM; and finite element code TELEMAC3D are considered in this study. The work has been carried out by competent hydraulic modellers who are users of the codes and not involved in their development. This paper is therefore written from the perspective of independent practitioners of the techniques. In all codes, the flow calculations are performed by solving the three-dimensional continuity and Reynolds-averaged Navier–Stokes equations with the k–ε turbulence model. The application of each code was carried out independently and this led to slightly different, but nonetheless valid, models. This is particularly seen in the different boundary conditions which have been applied and which arise in part from differences in the modelling approaches and methodology adopted by the different research groups and in part from the different assumptions and formulations implemented in the different codes. Similar finite volume meshes are used in the simulations with PHOENICS, FLUENT and SSIIM while in TELEMAC3D, a triangular finite element mesh is used. The ASME Journal of Fluids Engineering editorial policy is taken as a minimum framework for the control of numerical accuracy. In all cases, grid convergence is demonstrated and conventional criteria, such as Y⁺, are satisfied. A rigorous inter-comparison of the codes is performed using large-scale experimental data from the UK Flood Channel Facility for a two-stage meandering channel. This example data set shows complex hydraulic behaviour without the additional complications found in natural rivers. Standardised methods are used to compare each model with the available experimental data. Results are shown for the streamwise and transverse velocities, secondary flow, turbulent kinetic energy, bed shear stress and free surface elevation. They demonstrate that the models produce similar results overall, although there are some differences in the predicted flow field and greater differences in turbulent kinetic energy and bed shear stress. This study is seen as an essential first step in the inter-comparison of some of the computational fluid dynamics codes used in the field of river engineering.     

Generalized Gabidulin codes over fields of any characteristic

We generalize Gabidulin codes to a large family of fields, non necessarily finite, possibly with characteristic zero. We consider a general field extension and any automorphism in the Galois group of the extension. This setting enables one to give several definitions of metrics related to the rank-metric, yet potentially different. We provide sufficient conditions on the given automorphism to ensure that the associated rank metrics are indeed all equal and proper, in coherence with the usual definition from linearized polynomials over finite fields. Under these conditions, we generalize the notion of Gabidulin codes. We also present an algorithm for decoding errors and erasures, whose complexity is given in terms of arithmetic operations. Over infinite fields the notion of code alphabet is essential, and more issues appear that in the finite field case. We first focus on codes over integer rings and study their associated decoding problem. But even if the code alphabet is small, we have to deal with the growth of intermediate values. A classical solution to this problem is to perform the computations modulo a prime ideal. For this, we need study the reduction of generalized Gabidulin codes modulo an ideal. We show that the codes obtained by reduction are the classical Gabidulin codes over finite fields. As a consequence, under some conditions, decoding generalized Gabidulin codes over integer rings can be reduced to decoding Gabidulin codes over a finite field.     

Linearly representable codes over chain rings

In this paper, we consider linear codes over finite chain rings. We present a general mapping which produces codes over smaller alphabets. Under special conditions, these codes are linear over a finite field. We introduce the notion of a linearly representable code and prove that certain MacDonald codes are linearly representable. Finally, we give examples for good linear codes over finite fields obtained from special multisets in projective Hjelmslev planes.     

Non-invertible-element constacyclic codes over finite PIRs

In this paper we introduce the notion of λ-constacyclic codes over finite rings R for arbitrary element λ of R. We study the non-invertible-element constacyclic codes (NIE-constacyclic codes) over finite principal ideal rings (PIRs). We determine the algebraic structures of all NIE-constacyclic codes over finite chain rings, give the unique form of the sets of the defining polynomials and obtain their minimum Hamming distances. A general form of the duals of NIE-constacyclic codes over finite chain rings is also provided. In particular, we give a necessary and sufficient condition for the dual of an NIE-constacyclic code to be an NIE-constacyclic code. Using the Chinese Remainder Theorem, we study the NIE-constacyclic codes over finite PIRs. Furthermore, we construct some optimal NIE-constacyclic codes over finite PIRs in the sense that they achieve the maximum possible minimum Hamming distances for some given lengths and cardinalities.     

Weight enumeration of codes from finite spaces

We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a finite projective or affine space. As a result from the geometric method we use for the weight enumeration, we also completely determine the set of supports of subcodes and words in an extension code.     

On maximal Spherical codes II

We consider spherical codes attaining the Levenshtein upper bounds on the cardinality of codes with prescribed maximal inner product. We prove that the even Levenshtein bounds can be attained only by codes which are tight spherical designs. For every fixed n ≥ 5, there exist only a finite number of codes attaining the odd bounds. We derive different expressions for the distance distribution of a maximal code. As a by-product, we obtain a result about its inner products. We describe the parameters of those codes meeting the third Levenshtein bound, which have a regular simplex as a derived code. Finally, we discuss a connection between the maximal codes attaining the third bound and strongly regular graphs. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 316–326, 1999     

Constructing self-orthogonal and Hermitian self-orthogonal codes via weighing matrices and orbit matrices

We define the notion of an orbit matrix with respect to standard weighing matrices, and with respect to types of weighing matrices with entries in a finite field. In the latter case we primarily restrict our attention the fields of order 2, 3 and 4. We construct self-orthogonal and Hermitian self-orthogonal linear codes over finite fields from these types of weighing matrices and their orbit matrices respectively. We demonstrate that this approach applies to several combinatorial structures such as Hadamard matrices and balanced generalized weighing matrices. As a case study we construct self-orthogonal codes from some weighing matrices belonging to some well known infinite families, such as the Paley conference matrices, and weighing matrices constructed from ternary periodic Golay pairs.     

有限环上r-MDR码与r-MDS码

本文研究了有限环上r-MDR码与r-MDS码.利用主理想环CRT（R₁,R₂,…,R_s）上的r-MDR码或P_r-MDS码CRT（C₁,C₂,…,C_s）,得到了某个链环R_i上的码C_i也是r-MDR码或P_r-MDR码.特别地,对于有限链环上的码C,给出了它的挠码Tor_i（C）为r-MDR码与r-MDS码的条件.     

On repeated-root multivariable codes over a finite chain ring

In this work we consider repeated-root multivariable codes over a finite chain ring. We show conditions for these codes to be principally generated. We consider a suitable set of generators of the code and compute its minimum distance. As an application we study the relevant example of the generalized Kerdock code in its r-dimensional cyclic version.      

Codes as Fractals and Noncommutative Spaces

We consider the CSS algorithm relating self-orthogonal classical linear codes to q-ary quantum stabilizer codes and we show that to such a pair of a classical and a quantum code one can associate geometric spaces constructed using methods from noncommutative geometry, arising from rational noncommutative tori and finite abelian group actions on Cuntz algebras and fractals associated to the classical codes.     

A number theoretical observation about the degeneracy of the genetic code

We discuss the similarity of the degeneration structure of the genetic code with a purely number theoretic “divisors code.” The most interesting thing about our observation is not that there is a connection between number theory and the genetic code, but the simplicity of the rule. We hope that the observation and the naive model presented in this paper will spur ideas for other models of the degeneracy of the genetic code. Maybe, the ideas of this article can also be used in the area of artificial life to synthesize artificial genetic codes.     

Group rings, <Emphasis Type="Italic">G</Emphasis>-codes and constructions of self-dual and formally self-dual codes

We describe G-codes, which are codes that are ideals in a group ring, where the ring is a finite commutative Frobenius ring and G is an arbitrary finite group. We prove that the dual of a G-code is also a G-code. We give constructions of self-dual and formally self-dual codes in this setting and we improve the existing construction given in Hurley (Int J Pure Appl Math 31(3):319–335, 2006) by showing that one of the conditions given in the theorem is unnecessary and, moreover, it restricts the number of self-dual codes obtained by the construction. We show that several of the standard constructions of self-dual codes are found within our general framework. We prove that our constructed codes must have an automorphism group that contains G as a subgroup. We also prove that a common construction technique for producing self-dual codes cannot produce the putative [72, 36, 16] Type II code. Additionally, we show precisely which groups can be used to construct the extremal Type II codes over length 24 and 48. We define quasi-G codes and give a construction of these codes.     

Constructions of optimal LCD codes over large finite fields

In this paper¹, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis.     

A generalized Gleason–Pierce–Ward theorem

The Gleason–Pierce–Ward theorem gives constraints on the divisor and field size of a linear divisible code over a finite field whose dimension is half of the code length. This result is a departure point for the study of self-dual codes. In recent years, additive codes have been studied intensively because of their use in additive quantum codes. In this work, we generalize the Gleason–Pierce–Ward theorem on linear codes over GF(q), q = p ^m , to additive codes over GF(q). The first step of our proof is an application of a generalized upper bound on the dimension of a divisible code determined by its weight spectrum. The bound is proved by Ward for linear codes over GF(q), and is generalized by Liu to any code as long as the MacWilliams identities are satisfied. The trace map and an analogous homomorphism on GF(q) are used to complete our proof.      

Improved decoding of affine-variety codes

General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding techniques for affine-variety codes using some multidimensional extensions of general error locator polynomials. We prove the existence of such polynomials for any correctable affine-variety code and hence for any linear code. We propose two main different approaches, that depend on the underlying geometry. We compute some interesting cases, including Hermitian codes. To prove our coding theory results, we develop a theory for special classes of zero-dimensional ideals, that can be considered generalizations of stratified ideals. Our improvement with respect to stratified ideals is twofold: we generalize from one variable to many variables and we introduce points with multiplicities.     

On the existence of self-dual permutation codes of finite groups

Motivated by a research on self-dual extended group codes, we consider permutation codes obtained from submodules of a permutation module of a finite group of odd order over a finite field, and demonstrate that the condition “the extension degree of the finite field extended by n’th roots of unity is odd” is sufficient but not necessary for the existence of self-dual extended transitive permutation codes of length n + 1. It exhibits that the permutation code is a proper generalization of the group code, and has more delicate structure than the group code.     

Linear closures of finite geometries

The interrelations between finite geometries (finite incidence structures) and linear codes over finite fields are discussed under some special fundamental aspects. For any incidence structure \({\mathcal{I}}\) block codes, block-difference codes and co-block codes over finite fields of characteristic p are discussed resp. introduced; correspondingly p-modular co-blocks are defined for \({\mathcal{I}}\). Orthogonality modulo p is introduced as a concept relating different geometries having the same point set. Conversely three types of block-tactical geometries may be derived from vector classes of fixed Hamming weight in a given linear code. These geometries are tactical configurations if the given code admits a transitive permutation group. A combination of both approaches leads to the concept of p-closure of a finite geometry and to the notions of p-closed, weakly p-closed and p-dense incidence structures. These geometric concepts are applied to simple or directed graphs via their natural “adjacency geometry”. Here the above mentioned code theoretic treatment leads to the concept of p-modular co-adjacent vertex sets. As instructive examples the Petersen graph, its complemetary graph and the Higman-Sims graph are considered.