Negacyclic codes of length 2s over Galois rings

被引:82
作者
Dinh, HQ [1 ]
机构
[1] Kent State Univ, Dept Math Sci, Warren, OH 44483 USA
关键词
codes over finite rings; dual codes; Galois rings; Hamming weights; negacyclic codes;
D O I
10.1109/TIT.2005.859284
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Codes over the ring of integers modulo 4 have been studied by many researchers. Negacyclic codes such that the length n of the code is odd have been characterized over the alphabet Z(4), and furthermore, have been generalized to the case of the alphabet being a finite commutative chain ring. In this paper, we investigate negacyclic codes of length 2(s) over Galois rings. The structure of negacyclic codes of length 2(s) over the Galois rings GR(2(alpha), m), as well as that of their duals, are completely obtained. The Hamming distances of negacyclic codes over GR(2(alpha), m) in general,and over Z(2 alpha) in particular are studied. Among other more general results, the Hamming distances of all negacyclic codes over Z(2 alpha) of length 4, 8, and 16 are given. The weight distributions of such negacyclic codes are also discussed.
引用
收藏
页码:4252 / 4262
页数:11
相关论文
共 29 条
[1]   On the generators of Z4 cyclic codes of length 2e [J].
Abualrub, T ;
Oehmke, R .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (09) :2126-2133
[2]  
ABUALRUB T, IN PRESS INT J COMM
[3]   Decoding of linear codes over Galois rings [J].
Babu, NS ;
Zimmermann, KH .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (04) :1599-1603
[4]  
Berlekamp E. R., 1984, ALGEBRAIC CODING THE
[5]  
Berlekamp E. R., 1968, PROC C COMBINATORIAL, P298
[6]   Cyclic codes over Z4 of oddly even length [J].
Blackford, T .
DISCRETE APPLIED MATHEMATICS, 2003, 128 (01) :27-46
[7]   Negacyclic codes over Z4 of even length [J].
Blackford, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (06) :1417-1424
[8]   Hamming metric decoding of alternant codes over Galois rings [J].
Byrne, E ;
Fitzpatrick, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (03) :683-694
[9]   Decoding a class of Lee metric codes over a Galois ring [J].
Byrne, E .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (04) :966-975
[10]   Grobner bases over Galois rings with an application to decoding alternant codes [J].
Byrne, E ;
Fitzpatrick, P .
JOURNAL OF SYMBOLIC COMPUTATION, 2001, 31 (05) :565-584