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
References
N. Aydin, I. Siap, and D. K. Ray-Chaudhuri, The structure of 1-generator quasi-twisted codes and new linear codes, Des. Codes Cryptogr. 24(3) (2001) 313–326.
N. Aydin and I. Siap, New quasi-cyclic codes over $\mathbb{F}_5$, Appl. Math. Lett. 15(7) (2002) 833–836.
N. Aydin and D. Foret, New linear codes over $\operatorname{GF}(3)$, $\operatorname{GF}(11)$, and $\operatorname{GF}(13)$, J. Algebra Comb. Discrete Appl. 6(1) (2019) 13–20.
W. Bosma, J. Cannon, and C. Playoust, The Magma algebra system I: The user language, J. Symbolic Comput. 24(3-4) (1997) 235–265.
C. L. Chen, W. W. Peterson, and E. J. Weldon, Jr., Some results on quasi-cyclic codes, Inform. and Control 15(5) (1969) 407–423.
E. Z. Chen, Six new binary quasi-cyclic codes, IEEE Trans. Inform. Theory 40(5) (1994) 1666–1667.
E. Z. Chen, New quasi-cyclic codes from simplex codes, IEEE Trans. Inform. Theory 53(3) (2007) 1193–1196.
E. Z. Chen, A new iterative computer search algorithm for good quasi-twisted codes, Des. Codes Cryptogr. 76(2) (2015) 307–323.
E. Z. Chen and N. Aydin, A database of linear codes over $\mathbb{F}_{13}$ with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm, J. Algebra Comb. Discrete Appl. 2(1) (2015) 1–16.
E. Z. Chen, Database of quasi-twisted codes, available at http://databases.cs.hkr.se/qtcodes/index.htm.
E. Z. Chen, New binary $h$-generator quasi-cyclic codes by augmentation and new minimum distance bounds, Des. Codes Cryptogr. 80(1) (2016) 1–10.
R. N. Daskalov and T. A. Gulliver, New good quasi-cyclic ternary and quaternary linear codes, IEEE Trans. Inform. Theory 43(5) (1997) 1647–1650.
R. Daskalov and P. Hristov, Some new quasi-twisted ternary linear codes, J. Algebra Comb. Discrete Appl. 2(3) (2015) 211–216.
R. Daskalov and T. A. Gulliver, Bounds on minimum distance for linear codes over $\operatorname{GF}(5)$, Appl. Algebra Engrg. Comm. Comput. 9(6) (1999) 547–558.
R. Daskalov and E. Metodieva, Generating generalized necklaces and new quasi-cyclic codes, J. Algebra Comb. Discrete Appl. 7(3) (2020) 237–245.
M. Grassl, Bounds on the minimum distances of linear codes, available at http://www.codetables.de.
T. A. Gulliver and V. K. Bhargava, Some best rate $1/p$ and rate $(p-1)/p$ systematic quasi-cyclic codes, IEEE Trans. Inform. Theory 37(3) (1991) 552–555.
T. A. Gulliver and V. K. Bhargava, Nine good rate $(m-1)/pm$ quasi-cyclic codes, IEEE Trans. Inform. Theory 38(4) (1992) 1366–1369.
T. A. Gulliver and V. K. Bhargava, Some best rate $1/p$ and rate $(p-1)/p$ systematic quasi-cyclic codes over $\operatorname{GF}(3)$ and $\operatorname{GF}(4)$, IEEE Trans. Inform. Theory 38(4) (1992) 1369–1374.
T. A. Gulliver and V. Ch. Venkaiah, Construction of quasi-twisted codes and enumeration of defining polynomials, J. Algebra Comb. Discrete Appl. 7(1) (2020) 3–20.
I. Siap, N. Aydin, and D. Ray-Chaudhuri, New ternary quasi-cyclic codes with better minimum distances, IEEE Trans. Inform. Theory 46(4) (2000) 1554–1558.
H. C. A. van Tilborg, On quasi-cyclic codes with rate $1/m$, IEEE Trans. Inform. Theory 24(5) (1978) 628–630.
V. Ch. Venkaiah and T. A. Gulliver, Quasi-cyclic codes over $\mathbb{F}_{13}$ and enumeration of defining polynomials, J. Discrete Algorithms 16 (2012) 249–257.
