DocumentCode
1355918
Title
New ternary quasi-cyclic codes with better minimum distances
Author
Siap, Irfan ; Aydin, Nuh ; Ray-Chaudhuri, Dijen K.
Author_Institution
Dept. of Math., Ohio State Univ., Columbus, OH, USA
Volume
46
Issue
4
fYear
2000
fDate
7/1/2000 12:00:00 AM
Firstpage
1554
Lastpage
1558
Abstract
One of the most important problems of coding theory is to construct codes with best possible minimum distances. In this article, using the structure of quasi-cyclic (QC) codes with a BCH-type bound given by Lally and Fitzpatrick (see WCC ´99, Workshop on Coding and Cryptography, Paris, France, 1999), we have found 20 new ternary quasi-cyclic codes with improved minimum distances
Keywords
cyclic codes; linear codes; ternary codes; BCH-type bound; coding theory; generator matrices; linear code; minimum distances; new codes; ternary quasi-cyclic codes; Geometry; HTML; Hamming distance; Linear code; Testing; Vectors;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.850694
Filename
850694
Link To Document