On existence of good self-dual quasi-cyclic codes

被引:13
作者
Dey, BK [1 ]
机构
[1] Int Inst Informat Technol, Hyderabad 500019, Andhra Pradesh, India
关键词
discrete Fourier transform (DFT); Gilbert-Varshamov bound; permutation group; quasi-cyclic codes; self-dual codes;
D O I
10.1109/TIT.2004.831855
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
For a long time, asymptotically good self-dual codes have been known to exist. Asymptotically good 2-quasi-cyclic codes of rate 1/2 have also been known to exist for a long time. Recently, it was proved that there are binary self-dual n/3-quasi-cyclic codes of length n asymptotically meeting the Gilbert-Varshamov bound. Unlike 2-quasi-cyclic codes, which are defined to have a cyclic group of order n/2 as a subgroup of their permutation group, the n/3-quasi-cyclic codes are defined with a permutation group of fixed order of 3. So, from the decoding point of view, 2-quasi-cyclic codes are preferable to n/3-quasi-cyclic codes. In this correspondence, with the assumption that there are infinite primes p with respect to (w r t.) which 2 is primitive, we prove that there exist classes of self-dual 2p-quasi-cyclic codes and Type II 8p-quasi-cyclic codes of length respectively 2p(2) and 8p(2) which asymptotically meet the Gilbert-Varshamov bound. When compared with the order of the defining permutation groups, these classes of codes lie between the 2-quasi-cyclic codes and the n/3-quasi-cyclic codes of length n, considered in previous works.
引用
收藏
页码:1794 / 1798
页数:5
相关论文
共 8 条
[1]   SOME RESULTS ON QUASI-CYCLIC CODES [J].
CHEN, CL ;
PETERSON, WW .
INFORMATION AND CONTROL, 1969, 15 (05) :407-&
[2]   Codes closed under arbitrary abelian group of permutations [J].
Dey, BK ;
Rajan, BS .
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, :201-201
[3]   GILBERT-VARSHAMOV BOUND FOR QUASI-CYCLIC CODES OF RATE 1-2 [J].
KASAMI, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (05) :679-679
[4]   Good self-dual quasi-cyclic codes exist [J].
Ling, S ;
Solé, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (04) :1052-1053
[5]   On the algebraic structure of quasi-cyclic codes I:: Finite fields [J].
Ling, S ;
Solé, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) :2751-2760
[6]  
MacWilliams F. J., 1972, Discrete Mathematics, V3, P153, DOI 10.1016/0012-365X(72)90030-1
[7]  
MACWILLIAMS FJ, 1988, THEOR ERROR CORRECTI
[8]  
Rains EM, 1998, HANDBOOK OF CODING THEORY, VOLS I & II, P177