Abstract
One of the most important and challenging problems in coding theory is to construct codes with best possible parameters and properties. The class of quasi-cyclic (QC) codes is known to be fertile to produce such codes. Focusing on QC codes over the binary field, we have found 113 binary QC codes that are new among the class of QC codes using an implementation of a fast cyclic partitioning algorithm and the highly effective ASR algorithm. Moreover, these codes have the following additional properties: a) they have the same parameters as best known linear codes, and b) many of the have additional desired properties such as being reversible, LCD, self-orthogonal or dual-containing. Additionally, we present an algorithm for the generation of new codes from QC codes using ConstructionX, and introduce 33 new record breaking linear codes over GF(2), GF(3) and GF(5) produced from this method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ackerman R, Aydin N (2011) New quinary linear codes from quasi-twisted codes and their duals. Appl Math Lett 24(4):512–515
Akre D, Aydin N, Harrington MJ, Pandey SR (2021) New binary and ternary quasi-cyclic codes with good properties, arXiv preprint arXiv:2108.06752
Aydin N, Siap I, Ray-Chaudhuri D (2001) The structure of 1-generator quasi-twisted codes and new linear codes. Design Code Cryptogr 24:313–326
Aydin N, Connolly N, Grassl G (2017) Some results on the structure of constacyclic codes and new linear codes over GF(7) from quasi-twisted codes. Adv Math Commun 11:245–258
Aydin N, Lambrinos J, VandenBerg RO (2019) On Equivalence of cyclic codes, generalization of a Quasi-Twisted search algorithm, and new linear codes. Design Code Cryptogr. 87:2199–2212
Aydin N, Guidotti TH, Liu P, Shaikh AS, Robert O (2020) Some generalizations of the ASR search algorithm for quasitwisted codes Nuh Aydin. VandenBerg Involve J Math 13(1):137–48
Aydin N, Guidotti T, Liu P (2020) Good Classical and Quantum Codes from Multi-Twisted Codes, arXiv:2008.07037
Aydin N, VandenBerg RO (2021) A New Algorithm for Equivalence of Cyclic Codes and Its Applications, preprint, arXiv:2107.00159
Calderbank AR, Rains EM, Shor PW, Sloane NJA (1998) Quantum error correction via codes over GF(4). IEEE Trans Inform Theory 44:1369–1387
Chen E (2022) Quasi-Cyclic Codes: Bounds on the parameters of of QC codes, online, http://www.tec.hkr.se/~chen/research/codes/qc.htm
Daskalov R, Hristov P (2003) New quasi-twisted degenerate ternary linear codes. IEEE Trans Info Theo 49(9):2259–2263. https://doi.org/10.1109/TIT.2003.815798
Daskalov Rumen, Hristov Plamen (2017) Some new ternary linear codes. J Algebra Comb Discrete Struct Appl 4:227–234
Grassl M (2022) Code Tables: Bounds on the parameters of of codes, online, http://www.codetables.de/
Heyse S, von Maurich I, Güneysu T (2013) Keys Smaller, for Code-Based Cryptography: QC-MDPC McEliece Implementations on Embedded Devices, in Cryptographic Hardware and Embedded Systems - CHES, (2013) editors Bertoni. Guido and Coron, Jean-Sébastien, Springer, Berlin Heidelberg, Berlin, Heidelberg 273–292
Lu L, Li R, Fu Q, Xuan C, Ma W (2020) Optimal Ternary Linear Complementary Dual Codes. arXiv:2012.12093v2 [cs.IT]
MacWilliams FJ, Sloane NJ (1977) The theory of error correcting codes. Elsevier, Amsterdam
Magma computer algebra system (2022) online, http://magma.maths.usyd.edu.au/
Massey J (1964) Reversible Codes. Info Control 7:369–380
Massey JL (1992) Linear codes with complementary duals. Discrete Math 106(107):337–342
Petrank E, Roth RM (1997) Is code equivalence easy to decide? IEEE Trans Info Theo 43(5):1602–1604. https://doi.org/10.1109/18.623157
Sloane N, Reddy S, Chen C-L (1972) New binary codes. IEEE Trans Info Theo 18(4):503–510
Vardy A (1997) The intractability of computing the minimum distance of a code. IEEE Trans Inform Theory 43:1757–1766
Acknowledgements
This work was supported by Kenyon College Summer Science Scholars program. A preliminary version of this manuscript is available at (Akre et al. 2021).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Thomas Aaron Gulliver.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Akre, D., Aydin, N., Harrington, M.J. et al. New binary and ternary quasi-cyclic codes with good properties. Comp. Appl. Math. 42, 102 (2023). https://doi.org/10.1007/s40314-022-01946-8
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-022-01946-8