Negacyclic codes over Galois rings of characteristic 2 a

We investigate negacyclic codes over the Galois ring GR(2 a ,m) of length N = 2 k n,where n is odd and k 0.We first determine the structure of u-constacyclic codes of length n over the finite chain ring GR(2 a ,m)[u]/ u 2 k + 1 .Then using a ring isomorphism we obtain the structure of negacyclic codes over GR(2 a ,m) of length N = 2 k n (n odd) and explore the existence of self-dual negacyclic codes over GR(2 a ,m).A bound for the homogeneous distance of such negacyclic codes is also given.     

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.      

On self-orthogonal group ring codes

We obtain structural results about group ring codes over F[G], where F is a finite field of characteristic p > 0 and the Sylow p-subgroup of the Abelian group G is cyclic. As a special case, we characterize cyclic codes over finite fields in the case the length of the code is divisible by the characteristic of the field. By the same approach we study cyclic codes of length m over the ring R = F _q [u], u ^r  = 0 with r  > 0, gcd(m, q) = 1. Finally, we give a construction of quasi-cyclic codes over finite fields.      

环F2+uF2+vF2上自对偶码的两种构造方法

本文研究环R=F2+uF2+vF2上的自对偶码问题.利用Rn到F3n2的Gray映射及R上的自对偶码C的Gray像为F2上自对偶码,获得了R上任何偶长度的自对偶码存在性的结论.最后,给出了R上两种构造自对偶码的方法.     

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.     

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.      

On binary self-dual codes of lengths 60, 62, 64 and 66 having an automorphism of order 9

A method for constructing binary self-dual codes having an automorphism of order p ² for an odd prime p is presented in (S. Bouyuklieva et al. IEEE. Trans. Inform. Theory, 51, 3678–3686, 2005). Using this method, we investigate the optimal self-dual codes of lengths 60 ≤ n ≤ 66 having an automorphism of order 9 with six 9-cycles, t cycles of length 3 and f fixed points. We classify all self-dual [60,30,12] and [62,31,12] codes possessing such an automorphism, and we construct many doubly-even [64,32,12] and singly-even [66,33,12] codes. Some of the constructed codes of lengths 62 and 66 are with weight enumerators for which the existence of codes was not known until now.      

Negacyclic duadic codes

This paper extends the concepts from cyclic duadic codes to negacyclic codes over F_q (q an odd prime power) of oddly even length. Generalizations of defining sets, multipliers, splittings, even-like and odd-like codes are given. Necessary and sufficient conditions are given for the existence of self-dual negacyclic codes over F_q and the existence of splittings of 2N, where N is odd. Other negacyclic codes can be extended by two coordinates in a way to create self-dual codes with familiar parameters.     

The classification of self-dual modular codes

A classification method of self-dual codes over Zm is given. If m=rs with relatively prime integers r and s, then the classification can be accomplished by double coset decompositions of Sn by automorphism groups of self-dual codes over Zr and Zs. We classify self-dual codes of length 4 over Zp for all primes p in terms of their automorphism groups and then apply our method to classify self-dual codes over Zm for arbitrary integer m. Self-dual codes of length 8 are also classified over Zpq for p,q=2,3,5,7.     

Presimplifiable and Cyclic Group Rings

Let R be any commutative ring with identity, and let C be a (finite or infinite) cyclic group. We show that the group ring R(C) is presimplifiable if and only if its augmentation ideal I(C) is presimplifiable. We conjecture that the group rings R(C _n ) are presimplifiable if and only if n = p ^m , p ∈ J(R), p is prime, and R is presimplifiable. We show the necessity of n = p ^m , and we prove the sufficiency when n = 2, 3, 4. These results were made possible by a new formula derived herein for the circulant determinantal coefficients.     

有限域上的重根自对偶负循环码

Let F_q be a finite field with q = p~m, where p is an odd prime. In this paper, we study the repeated-root self-dual negacyclic codes over Fq. The enumeration of such codes is investigated. We obtain all the self-dual negacyclic codes of length 2~ap~r over F_q, a ≥ 1.The construction of self-dual negacyclic codes of length 2~abp~r over F_q is also provided, where gcd(2, b) = gcd(b, p) = 1 and a ≥ 1.     

A note on cyclic codes over GR(p2, m) of length pk

The number of self-dual cyclic codes of length p ^k over GR(p ², m) is determined by the nullity of a certain matrix M(p ^k , i ₁). With the aid of Genocchi numbers, we determine the nullity of M(p ^k , i ₁) and hence determine completely the number of such codes.     

有限链环上循环码与负循环码的生成多项式

从另一种角度研究了有限链环上循环码.给出了这种环上循环码的构造由这种构造得到了有限链环上的循环码的生成多项式.借助有限链环上循环码与负循环码的同构,也得到了这种环上循环码的生成元.     

有限域上长为2mpn 的负循环码

设F_q 是奇数阶有限域. 本文主要借助X^2mpn+1 在F_q 上的不可约因式分解来确定有限域F_q上所有长为2^mpⁿ 的负循环码和自对偶的负循环码的生成多项式, 这里p 是q-1 的奇素因子, m 和n是正整数.     

Minimal cyclic codes of length pq

Explicit expressions for all the 3n+2 primitive idempotents in the ring R_pⁿq=GF(ℓ)[x]/(x^pnq−1), where p,q,ℓ are distinct odd primes, ℓ is a primitive root modulo pⁿ and q both, , are obtained. The dimension, generating polynomials and the minimum distance of the minimal cyclic codes of length pⁿq over GF(ℓ) are also discussed.     

Self-Orthogonal and Self-Dual Codes Constructed via Combinatorial Designs and Diophantine Equations

Combinatorial designs have been widely used, in the construction of self-dual codes. Recently, new methods of constructing self-dual codes are established using orthogonal designs (ODs), generalized orthogonal designs (GODs), a set of four sequences and Diophantine equations over GF(p). These methods had led to the construction of many new self-dual codes over small finite fields and rings. In this paper, we used some methods to construct self-orthogonal and self dual codes over GF(p), for some primes p. The construction is achieved by using some special kinds of combinatorial designs like orthogonal designs and GODs. Moreover, we combine eight circulant matrices, a system of Diophantine equations over GF(p), and a recently discovered array to obtain a new construction method. Using this method new self-dual and self-orthogonal codes are obtained. Specifically, we obtain new self-dual codes [32,16,12] over GF(11) and GF(13) which improve the previously known distances.     

New Extremal Type I Codes of Lengths 40, 42, and 44

It is known that it is possible to construct a generator matrix for a self-dual code of length 2n+2 from a generator matrix of a self-dual code of length 2n. With the aid of a computer, we construct new extremal Type I codes of lengths 40, 42, and 44 from extremal self-dual codes of lengths 38, 40, and 42 respectively. Among them are seven extremal Type I codes of length 44 whose weight enumerator is 1+224y ⁸+872y ¹⁰+·. A Type I code of length 44 with this weight enumerator was not known to exist previously.     

Some cyclic codes of length 2<Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

Explicit expressions for 4n + 2 primitive idempotents in the semi-simple group ring $R_{2p^{n}}\equiv \frac{GF(q)[x]}{p and q are distinct odd primes; n ≥ 1 is an integer and q has order \fracf(2pⁿ)2{\frac{\phi(2p^{n})}{2}} modulo 2p ⁿ . The generator polynomials, the dimension, the minimum distance of the minimal cyclic codes of length 2p ⁿ generated by these 4n + 2 primitive idempotents are discussed. For n = 1, the properties of some (2p, p) cyclic codes, containing the above minimal cyclic codes are analyzed in particular. The minimum weight of some subset of each of these (2p, p) codes are observed to satisfy a square root bound.     

Repeated-root cyclic and negacyclic codes over a finite chain ring

We show that repeated-root cyclic codes over a finite chain ring are in general not principally generated. Repeated-root negacyclic codes are principally generated if the ring is a Galois ring with characteristic a power of 2. For any other finite chain ring they are in general not principally generated. We also prove results on the structure, cardinality and Hamming distance of repeated-root cyclic and negacyclic codes over a finite chain ring.     

On the Key Equation Over a Commutative Ring

We define alternant codes over a commutative ring R and a corresponding key equation. We show that when the ring is a domain, e.g. the p-adic integers, the error-locator polynomial is the unique monic minimal polynomial (equivalently, the unique shortest linear recurrence) of the finite sequence of syndromes and that it can be obtained by Algorithm MR of Norton.WhenR is a local ring, we show that the syndrome sequence may have more than one (monic) minimal polynomial, but that all the minimal polynomials coincide modulo the maximal ideal ofR . We characterise the set of minimal polynomials when R is a Hensel ring. We also apply these results to decoding alternant codes over a local ring R: it is enough to find any monic minimal polynomial over R and to find its roots in the residue field. This gives a decoding algorithm for alternant codes over a finite chain ring, which generalizes and improves a method of Interlando et. al. for BCH and Reed-Solomon codes over a Galois ring.