An Explicit Construction of 2-Generator Quasi-Twisted Codes

被引:12
作者
Chen, Eric Z. [1 ]
机构
[1] Kristianstad Univ Coll, Dept Comp Sci, S-29188 Kristianstad, Sweden
关键词
Linear codes; optimal codes; quasi-cyclic codes; quasi-twisted codes; simplex codes;
D O I
10.1109/TIT.2008.2006430
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that many codes in the family meet the Griesmer bound and therefore are length-optimal. New distance-optimal binary QC [195: 8196], [210, 8 7 104], and [240, 8 120] codes, and good ternary QC [208, 6: 135] and [221, 6, 144]codes are also obtained by the construction.
引用
收藏
页码:5770 / 5773
页数:4
相关论文
共 22 条
[1]  
[Anonymous], WEB DATABASE BINARY
[2]   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
[3]  
Berlekamp E. R., 1984, ALGEBRAIC CODING THE
[4]   THE GEOMETRY OF 2-WEIGHT CODES [J].
CALDERBANK, R ;
KANTOR, WM .
BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 1986, 18 :97-122
[5]   SOME RESULTS ON QUASI-CYCLIC CODES [J].
CHEN, CL ;
PETERSON, WW .
INFORMATION AND CONTROL, 1969, 15 (05) :407-&
[6]   New quasi-cyclic codes from simplex codes [J].
Chen, Eric Z. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (03) :1193-1196
[7]  
CHEN EZ, WEB DATABASE 2 WEIGH
[8]  
CHEN Z, 1994, IEEE T INFORM THEORY, V40, P1666
[9]   New minimum distance bounds for linear codes over GF(5) [J].
Daskalov, R ;
Hristov, P ;
Metodieva, E .
DISCRETE MATHEMATICS, 2004, 275 (1-3) :97-110
[10]   New quasi-twisted degenerate ternary linear codes [J].
Daskalov, R ;
Hristov, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (09) :2259-2263