Coding and information theory
Optimal ternary quasi-cyclic codes
Designs, Codes and Cryptography
New Good Rate (m-1)/pm Ternary and Quaternary Quasi-Cyclic Codes
Designs, Codes and Cryptography
An Extension Theorem for Linear Codes
Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
Handbook of Coding Theory
Some Best Rate 1/p Quasi-Cyclic Codes over GF(5)
Selected Papers from the 4th Canadian Workshop on Information Theory and Applications II
Improved bounds for ternary linear codes of dimension 7
IEEE Transactions on Information Theory
New good quasi-cyclic ternary and quaternary linear codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A search algorithm for linear codes: progressive dimension growth
Designs, Codes and Cryptography
New MDS self-dual codes over finite fields
Designs, Codes and Cryptography
Finite Fields and Their Applications
Hi-index | 0.00 |
One of the most important problems of coding theory is to construct codes with best possible minimum distances. Recently, quasi-cyclic (QC) codes have been proven to contain many such codes. In this paper, we consider quasi-twisted (QT) codes, which are generalizations of QC codes, and their structural properties and obtain new codes which improve minimum distances of best known linear codes over the finite fields GF(3) and GF(5). Moreover, we give a BCH-type bound on minimum distance for QT codes and give a sufficient condition for a QT code to be equivalent to a QC code.