Asymptotically Good Additive Cyclic Codes Exist

Abstract

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.