DocumentCode :
991499
Title :
An Explicit Construction of 
Author :
Chen, E.Z.
Author_Institution :
Dept. of Comput. Sci., Kristianstad Univ. Coll., Kristianstad
Volume :
54
Issue :
12
fYear :
2008
Firstpage :
5770
Lastpage :
5773
Abstract :
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, 8, 96], [210, 8, 104], and [240, 8, 120] codes, and good ternary QC [208, 6, 135] and [221, 6, 144] codes are also obtained by the construction.
Keywords :
binary codes; cyclic codes; ternary codes; 2-generator quasi-twisted codes; Griesmer bound; consta-cyclic simplex codes; distance-optimal binary QC; quasi-cyclic codes; ternary QC; two-weight codes; Algebra; Error correction codes; Polynomials; Linear codes; optimal codes; quasi-cyclic codes; quasi-twisted codes; simplex codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2008.2006430
Filename :
4675723
Link To Document :
