Group codes over fields are asymptotically good
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.
- A Group Ring Construction of the Extended Binary Golay Code
- Asymptotic performance of metacyclic codes
- Codes of small defect
- scientific article; zbMATH DE number 3749242 (Why is no real title available?)
- scientific article; zbMATH DE number 826242 (Why is no real title available?)
- New lower bounds for minimum distance of linear quasi-cyclic and almost linear cyclic codes
- On primes \(p\) for which \(d\) divides \(\text{ord}_p(g)\)
- On the theory of group codes
- Some randomized code constructions from group actions
- The extended Golay codes considered as ideals
- Thresholds of Random Quasi-Abelian Codes
- Une generalisation de la construction de berman des codes de reed et muller p-aires
- Composite matrices from group rings, composite \(G\)-codes and constructions of self-dual codes
- Self-orthogonal quasi-abelian codes are asymptotically good
- A geometric characterization of minimal codes and their asymptotic performance
- Construction and enumeration of left dihedral codes satisfying certain duality properties
- On ideals in group algebras: an uncertainty principle and the Schur product
- Asymptotic performance of metacyclic codes
- Dihedral codes with prescribed minimum distance
- Some randomized code constructions from group actions
- Group block codes over nonabelian groups are asymptotically bad
- Codes in group algebras
- A characterization of abelian group codes in terms of their parameters
- On the number of non-\(G\)-equivalent minimal abelian codes
- On checkable codes in group algebras
- On the algebraic structure of quasi-group codes
- On BCH split metacyclic codes
- Matrix product structure of left generalized quaternion group codes
- On quasi-abelian codes over finite commutative chain rings and their dual codes
- Dihedral codes with 1-dimensional hulls and 1-dimensional linear complementary pairs of dihedral codes
- Metacyclic twisted codes
This page was built for publication: Group codes over fields are asymptotically good
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994954)
