Some results on the structure of constacyclic codes and new linear codes over GF(7) from quasi-twisted codes

One of the most important and challenging problems in coding theory is to construct codes with good parameters. There are various methods to construct codes with the best possible parameters. A promising and fruitful approach has been to focus on the class of quasi-twisted (QT) codes which includes constacyclic codes as a special case. This class of codes is known to contain many codes with good parameters. Although constacyclic codes and QT codes have been the subject of numerous studies and computer searches over the last few decades, we have been able to discover a new fundamental result about the structure of constacyclic codes which was instrumental in our comprehensive search method for new QT codes over GF(7). We have been able to find 41 QT codes with better parameters than the previously best known linear codes. Furthermore, we derived a number of additional new codes via Construction X as well as standard constructions, such as shortening and puncturing.

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

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

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

[4]  Tsonka S. Baicheva.  On the covering radius of ternary negacyclic codes with length up to 26 , 2001, IEEE Trans. Inf. Theory.

[5]  Eric Zhi Chen,et al.  A database of linear codes over F13 with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm , 2015 .

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

[7]  T. Aaron Gulliver,et al.  New quasi-twisted quaternary linear codes , 2000, IEEE Trans. Inf. Theory.

[8]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[9]  Markus Grassl,et al.  New codes from chains of quasi-cyclic codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[10]  Zhi Chen.  Six new binary quasi-cyclic codes , 1994, IEEE Trans. Inf. Theory.

[11]  Vijay K. Bhargava,et al.  New Good Rate (m-1)/pm Ternary and Quaternary Quasi-Cyclic Codes , 1996, Des. Codes Cryptogr..

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

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

[14]  N. Aydin,et al.  New quasi-twisted codes over F11— minimum distance bounds and a new database , 2015 .

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

[16]  Markus Grassl,et al.  Computing extensions of linear codes using a greedy algorithm , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[17]  Greg White,et al.  New good linear codes by special puncturings , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[18]  Rumen N. Daskalov,et al.  New binary one-generator quasi-cyclic codes , 2003, IEEE Trans. Inf. Theory.

[19]  Markus Grassl,et al.  Searching for linear codes with large minimum distance , 2006 .

[20]  Irfan Siap,et al.  New quasi-cyclic codes over F5 , 2002, Appl. Math. Lett..