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
fDate :
7/1/2000 12:00:00 AM
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;
Journal_Title :
Information Theory, IEEE Transactions on
