Long cyclic codes are good

Long quasi-cyclic codes of any fixed index $>1$ have been shown to be asymptotically good, depending on Artin primitive root conjecture in (A. Alahmadi, C. G\"uneri, H. Shoaib, P. Sol\'e, 2017). We use this recent result to construct good long additive cyclic codes on any extension of fixed degree of the base field. Similarly self-dual double circulant codes, and self-dual four circulant codes, have been shown to be good, also depending on Artin primitive root conjecture in (A. Alahmadi, F. \"Ozdemir, P. Sol\'e, 2017) and ( M. Shi, H. Zhu, P. Sol\'e, 2017) respectively. Building on these recent results, we can show that long cyclic codes are good over $\F_q,$ for many classes of $q$'s. This is a partial solution to a fifty year old open problem.

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

[2]  Juergen Bierbrauer Introduction to coding theory , 2005, Discrete mathematics and its applications.

[3]  Pascale Charpin Cyclic Codes , 2005, Encyclopedia of Cryptography and Security.

[4]  Wolfgang Willems,et al.  Is the class of cyclic codes asymptotically good? , 2006, IEEE Transactions on Information Theory.

[5]  Patrick Solé,et al.  On self-dual double circulant codes , 2016, Designs, Codes and Cryptography.

[6]  Patrick Solé,et al.  On the algebraic structure of quasi-cyclic codes I: Finite fields , 2001, IEEE Trans. Inf. Theory.

[7]  C. Hooley On Artin's conjecture. , 1967 .

[8]  Y. Edel,et al.  Quantum twisted codes , 2000 .

[9]  Cem Güneri,et al.  Hasse–Weil bound for additive cyclic codes , 2017, Des. Codes Cryptogr..

[10]  E. J. Weldon,et al.  Some Results on Quasi-Cyclic Codes , 1969, Inf. Control..

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

[12]  Jürgen Bierbrauer,et al.  The Theory of Cyclic Codes and a Generalization to Additive Codes , 2002, Des. Codes Cryptogr..