Group codes over fields are asymptotically good (Q1994954)

Let \((C_m)_{m\ge0}\) be a sequence of codes over \(\mathbb{F}_q\), where each \(C_m\) is a \([n_m, k_m, d_m]_q\)-code. We say that \((C_m)_{m\ge0}\) is asymptotically good if \[ \liminf_{m\rightarrow\infty} \frac{k_m}{n_m}>0 \] and \[ \liminf_{m\rightarrow\infty} \frac{d_m}{n_m}>0. \] It is important to notice that only a few families of codes are known to achieve this property (e.g. AG codes, expander codes, Justesen codes). Let \(\mathbb{F}\) be a field of positive characteristic and \(G\) be a finite group. A group algebra code, or \(G\)-code, is a code defined by a right or left ideal in the group algebra \(\mathbb{F}G\). These codes have been widely studied in the last years due to their nice algebraic structure that allows the study of their properties. In this paper, the authors, using ideas in [\textit{L. M. J. Bazzi} and \textit{S. K. Mitter}, IEEE Trans. Inf. Theory 52, No. 7, 3210--3219 (2006; Zbl 1285.94117)], prove that group codes over finite fields of any characteristic are asymptotically good.