New good quasi-cyclic codes and codes with improved minimum distance
DOI:
https://doi.org/10.13069/jacodesmath.v10i1.234Keywords:
Finite fields, Linear codes, Quasi-cyclic codes, AlgorithmsAbstract
One of the most important and challenging problems in coding theory is to construct codes with optimal parameters. As a generalization of cyclic codes, quasi-cyclic (QC) codes as well as quasi-twisted (QT) codes have been shown to contain record-breaking codes. In this paper, various computer algorithms have been used to search for good QC codes. A lot of good new QC codes have been found and they have been used to construct new linear codes. A total 11 new codes that improve the bound on the minimum distance are presented.
Received: 4 January 2022 | Accepted: 31 March 2022Downloads
Download data is not yet available.
Downloads
Published
2022-12-13
How to Cite
Chen, E. Z., & Jönsson, F. (2022). New good quasi-cyclic codes and codes with improved minimum distance. Journal of Algebra Combinatorics Discrete Structures and Applications, 10(1), 39–44. https://doi.org/10.13069/jacodesmath.v10i1.234
Issue
Section
Articles
