A New Algorithm for Equivalence of Cyclic Codes and Its Applications

Cyclic codes are among the most important families of codes in coding theory for both theoretical and practical reasons. Despite their prominence and intensive research on cyclic codes for over a half century, there are still open problems related to cyclic codes. In this work, we use recent results on the equivalence of cyclic codes to create a more efficient algorithm to partition cyclic codes by equivalence based on cyclotomic cosets. This algorithm is then implemented to carry out computer searches for both cyclic codes and quasi-cyclic (QC) codes with good parameters. We also generalize these results to repeated-root cases. We have found several new linear codes that are cyclic or QC as an application of the new approach, as well as more desirable constructions for linear codes with best known parameters. With the additional new codes obtained through standard constructions, we have found a total of 14 new linear codes.

[1]  Nuh Aydin,et al.  New quinary linear codes from quasi-twisted codes and their duals , 2011, Appl. Math. Lett..

[2]  Nuh Aydin,et al.  On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes , 2019, Des. Codes Cryptogr..

[3]  Erez Petrank,et al.  Is code equivalence easy to decide? , 1997, IEEE Trans. Inf. Theory.

[4]  Nicolas Sendrier,et al.  How easy is code equivalence over F_q , 2013 .

[5]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[6]  Nuh Aydin,et al.  New binary linear codes from quasi-cyclic codes and an augmentation algorithm , 2017, Applicable Algebra in Engineering, Communication and Computing.

[7]  Alexander Vardy,et al.  The intractability of computing the minimum distance of a code , 1997, IEEE Trans. Inf. Theory.

[8]  Rumen N. Daskalov,et al.  New minimum distance bounds for linear codes over GF(5) , 2004, Discret. Math..

[9]  Alessandro Barenghi,et al.  LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes , 2018, PQCrypto.

[10]  Dwijendra K. Ray-Chaudhuri,et al.  New ternary quasi-cyclic codes with better minimum distances , 2000, IEEE Trans. Inf. Theory.

[11]  Nuh Aydin,et al.  New linear codes from constacyclic codes , 2014, J. Frankl. Inst..

[12]  Edward Dobson,et al.  Monomial isomorphisms of cyclic codes , 2015, Des. Codes Cryptogr..

[13]  Dwijendra K. Ray-Chaudhuri,et al.  The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes , 2001, Des. Codes Cryptogr..

[14]  Markus Grassl,et al.  Some results on the structure of constacyclic codes and new linear codes over GF(7) from quasi-twisted codes , 2017, Adv. Math. Commun..

[15]  Irfan Siap,et al.  New ternary quasi-cyclic codes with improved minimum distances , 2002 .

[16]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[17]  Nicolas Sendrier,et al.  Finding the permutation between equivalent linear codes: The support splitting algorithm , 2000, IEEE Trans. Inf. Theory.

[18]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[19]  Dimitris E. Simos,et al.  The Hardness of Code Equivalence over F q and its Application to Code-based Cryptography , 2013 .

[20]  Rumen N. Daskalov,et al.  New quasi-twisted degenerate ternary linear codes , 2003, IEEE Trans. Inf. Theory.