New One-Generator Quasi-cyclic Codes over GF(7)
Problems of Information Transmission
New Quasi-cyclic Degenerate Linear Codes over GF(8)
Problems of Information Transmission
New Minimum Distance Bounds for Linear Codes over GF(9)
Problems of Information Transmission
A search algorithm for linear codes: progressive dimension growth
Designs, Codes and Cryptography
On quasi-cyclic codes over integer residue rings
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
On the construction of skew quasi-cyclic codes
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
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