MDS and self-dual codes over rings

In this paper we give the structure of constacyclic codes over formal power series and chain rings. We also present necessary and sufficient conditions on the existence of MDS codes over principal ideal rings. These results allow for the construction of infinite families of MDS self-dual codes over finite chain rings, formal power series and principal ideal rings. We also define the Reed–Solomon codes over principal ideal rings.     

MDS codes over finite principal ideal rings

The purpose of this paper is to study codes over finite principal ideal rings. To do this, we begin with codes over finite chain rings as a natural generalization of codes over Galois rings GR(p ^e , l) (including ). We give sufficient conditions on the existence of MDS codes over finite chain rings and on the existence of self-dual codes over finite chain rings. We also construct MDS self-dual codes over Galois rings GF(2 ^e , l) of length n = 2 ^l for any a ≥ 1 and l ≥ 2. Torsion codes over residue fields of finite chain rings are introduced, and some of their properties are derived. Finally, we describe MDS codes and self-dual codes over finite principal ideal rings by examining codes over their component chain rings, via a generalized Chinese remainder theorem.      

形式幂级数环上的自对偶码

形式幂级数环R_∞=F[[γ]]={sum from l=0 to a_lγ~l|a_l∈F}与有限链环R_i={a_0+a_1γ+…+a_(i-1)γ~(i-1)|a_i∈F}的码的投影与提升有密切关系.利用形式幂级数环R_∞上码C在有限链环R_i的投影码的自正交性与自对偶性来研究码C的自正交性与自对偶性,得到了两个有意义的结果.     

CYCLIC CODES OVER FORMAL POWER SERIES RINGS

In this article, cyclic codes and negacyclic codes over formal power series rings are studied. The structure of cyclic codes over this class of rings is given, and the relationship between these codes and cyclic codes over finite chain rings is obtained. Using an isomorphism between cyclic and negacyclic codes over formal power series rings, the structure of negacyclic codes over the formal power series rings is obtained.     

有限环上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 SELF-DUAL PERMUTATION CODES

Permutation codes over finite fields are introduced, some conditions for exis-tence or non-existence of self-dual permutation codes are obtained.     

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.     

Construction of MDS self-dual codes over Galois rings

The purpose of this paper is to construct nontrivial MDS self-dual codes over Galois rings. We consider a building-up construction of self-dual codes over Galois rings as a GF(q)-analogue of (Kim and Lee, J Combin Theory ser A, 105:79–95). We give a necessary and sufficient condition on which the building-up construction holds. We construct MDS self-dual codes of lengths up to 8 over GR(3²,2), GR(3³,2) and GR(3⁴,2), and near-MDS self-dual codes of length 10 over these rings. In a similar manner, over GR(5²,2), GR(5³,2) and GR(7²,2), we construct MDS self-dual codes of lengths up to 10 and near-MDS self-dual codes of length 12. Furthermore, over GR(11²,2) we have MDS self-dual codes of lengths up to 12.      

Homogeneous weights of matrix product codes over finite principal ideal rings

In this paper, the homogeneous weights of matrix product codes over finite principal ideal rings are studied and a lower bound for the minimum homogeneous weights of such matrix product codes is obtained.     

广义幂级数环的本质理想和非奇异性

本文研究了广义幂级数环与其系数环在本质理想和非奇异性上的关系.利用本质理想的定义和性质,得到了广义幂级数环的左理想为本质左理想的菪干充分必要条件.在此基础上,给出了广义幂级数环为左非奇异环的充分必要条件.     

Structure Theorems for Group Ring Codes with an Application to Self-Dual Codes

Using ideas from the cohomology of finite groups, an isomorphism is established between a group ring and the direct sum of twisted group rings. This gives a decomposition of a group ring code into twisted group ring codes. In the abelian case the twisted group ring codes are (multi-dimensional) constacyclic codes. We use the decomposition to prove that, with respect to the Euclidean inner product, there are no self-dual group ring codes when the group is the direct product of a 2-group and a group of odd order, and the ring is a field of odd characteristic or a certain modular ring. In particular, there are no self-dual abelian codes over the rings indicated. Extensions of these results to non-Euclidean inner products are briefly discussed.     

Self-dual codes over commutative Frobenius rings

We prove that self-dual codes exist over all finite commutative Frobenius rings, via their decomposition by the Chinese Remainder Theorem into local rings. We construct non-free self-dual codes under some conditions, using self-dual codes over finite fields, and we also construct free self-dual codes by lifting elements from the base finite field. We generalize the building-up construction for finite commutative Frobenius rings, showing that all self-dual codes with minimum weight greater than 2 can be obtained in this manner in cases where the construction applies.     

Construction of MDS Self-dual Codes over Finite Fields

In this paper, we obtain some new results on the existence of MDS self-dual codes utilizing (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. For finite field with odd characteristic and square cardinality, our results can produce more classes of MDS self-dual codes than previous works.     

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.     

2n Bordered constructions of self-dual codes from group rings

Self-dual codes, which are codes that are equal to their orthogonal, are a widely studied family of codes. Various techniques involving circulant matrices and matrices from group rings have been used to construct such codes. Moreover, families of rings have been used, together with a Gray map, to construct binary self-dual codes. In this paper, we introduce a new bordered construction over group rings for self-dual codes by combining many of the previously used techniques. The purpose of this is to construct self-dual codes that were missed using classical construction techniques by constructing self-dual codes with different automorphism groups. We apply the technique to codes over finite commutative Frobenius rings of characteristic 2 and several group rings and use these to construct interesting binary self-dual codes. In particular, we construct some extremal self-dual codes of length 64 and 68, constructing 30 new extremal self-dual codes of length 68.     

Type II Self-Dual Codes over Finite Rings and Even Unimodular Lattices

In this paper, we investigate self-dual codes over finite rings, specifically the ring of integers modulo 2m. Type II codes over are introduced as self-dual codes with Euclidean weights which are a multiple of 2m +1. We describe a relationship between Type II codes and even unimodular lattices. This relationship provides much information on Type II codes. Double circulant Type II codes over are also studied.     

A mass formula for self-dual permutation codes

For a module V over a finite semisimple algebra A we give the total number of self-dual codes in V. This enables us to obtain a mass formula for self-dual codes in permutation representations of finite groups over finite fields of coprime characteristic.     

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.     

MDS Self-Dual Codes over Large Prime Fields

Combinatorial designs have been used widely in the construction of self-dual codes. Recently a new method of constructing self-dual codes was established using orthogonal designs. This method has led to the construction of many new self-dual codes over small finite fields and rings. In this paper, we generalize this method by using generalized orthogonal designs, and we give another new method that creates and solves Diophantine equations over GF(p) in order to find suitable generator matrices for self-dual codes. We show that under the necessary conditions these methods can be applied as well to small and large fields. We apply these two methods to study self-dual codes over GF(31) and GF(37). Using these methods we obtain some new maximum distance separable self-dual codes of small orders.     

Self-dual codes over \mathbb{Z}_8 and \mathbb{Z}_9

We study self-dual codes over the rings and . We define various weights and weight enumerators over these rings and describe the groups of invariants for each weight enumerator over the rings. We examine the torsion codes over these rings to describe the structure of self-dual codes. Finally we classify self-dual codes of small lengths over .