Consta-Abelian codes over Galois rings

被引:5
作者
Kiran, T [1 ]
Rajan, BS [1 ]
机构
[1] Indian Inst Sci, Dept Elect Commun Engn, Bangalore 560012, Karnataka, India
关键词
Abelian codes; consta-Abelian codes; constacyclic codes; Galois rings; quasi-twisted (QT) codes; twisted discrete Fourier transform;
D O I
10.1109/TIT.2003.822619
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We study n-length consta-Abelian codes (a generalization of the well-known Abelian codes and constacyclic codes) over Galois rings of characteristic p(a), where n and p are coprime. A twisted discrete Fourier transform (DFT) is used to generalize transform domain results of Abelian and constacyclic codes, to consta-Abelian codes. Further, we characterize consta-Abelian codes invariant under two kinds of monomials, whose underlying permutations are effected by: i) multiplying the coordinates with a unit in the appropriate mixed-radix representation of the coordinate positions and ii) shifting the coordinates by t positions. All the codes studied here belong to the class of quasi-twisted codes which are known to contain some good codes. We show that the dual of a consta-Abelian code invariant under the two monomials is also a consta-Abelian code closed under both monomials.
引用
收藏
页码:367 / 380
页数:14
相关论文
共 24 条
[1]   The structure of 1-generator quasi-twisted codes and new linear codes [J].
Aydin, N ;
Siap, I ;
Ray-Chaudhuri, DK .
DESIGNS CODES AND CRYPTOGRAPHY, 2001, 24 (03) :313-326
[2]   Transform approach to permutation groups of cyclic codes over Galois rings [J].
Blackford, Jason Thomas ;
Ray-Chaudhuri, Dwijendra K. .
2000, IEEE, Piscataway, NJ, United States (46)
[3]   Constacyclic codes and constacyclic DFTs [J].
Boztas, S .
1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, :235-235
[4]   Hamming metric decoding of alternant codes over Galois rings [J].
Byrne, E ;
Fitzpatrick, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (03) :683-694
[5]   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
[6]  
BYRNE E, 2001, LECT NOTES COMPUTER, V2227, P255
[7]   Minimal tail-biting trellises: The Golay code and more [J].
Calderbank, AR ;
Forney, GD ;
Vardy, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (05) :1435-1455
[8]   STRUCTURAL-PROPERTIES AND ENUMERATION OF QUASI-CYCLIC CODES [J].
CONAN, J ;
SEGUIN, G .
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 1993, 4 (01) :25-39
[9]   New quasi-twisted quaternary linear codes [J].
Daskalov, R.N. ;
Aaron Gulliver, T. .
1600, IEEE, Piscataway, NJ, United States (46)
[10]  
DEY BK, 2001, LECT NOTES COMPUTER, V2227, P67