Good self-dual quasi-cyclic codes exist

被引:52
作者
Ling, S [1 ]
Solé, P
机构
[1] Natl Univ Singapore, Dept Math, Singapore 117543, Singapore
[2] ESSI, CNRS, F-06903 Sophia Antipolis, France
关键词
cubing construction; Gilbert-Varshamov bound; quasi-cyclic codes; self-dual codes;
D O I
10.1109/TIT.2003.809501
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We show that there are long binary quasi-cyclic self-dual (either the Type I or Type II) codes satisfying the Gilbert-Varshamov bound.
引用
收藏
页码:1052 / 1053
页数:2
相关论文
共 7 条
[1]   SELF-DUAL CODES OVER GF(3) AND GF(4) OF LENGTH NOT EXCEEDING 16 [J].
CONWAY, JH ;
PLESS, V ;
SLOANE, NJA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (03) :312-322
[2]   COSET CODES .2. BINARY LATTICES AND RELATED CODES [J].
FORNEY, GD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) :1152-1187
[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]   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
[5]  
Mac Williams F., 1977, THEORY ERROR CORRECT
[6]  
MacWilliams F. J., 1972, Discrete Mathematics, V3, P153, DOI 10.1016/0012-365X(72)90030-1
[7]  
Rains EM, 1998, HANDBOOK OF CODING THEORY, VOLS I & II, P177