IEEE Communications Letters · 2018 · 24 citations · 19 references
Computational Number TheoryRing TheoryFinite FieldFixed IndexComputational ComplexityQuasi-twisted CodesAlgebraic CombinatoricsVariable-length CodeDiscrete MathematicsAdditive Cyclic CodesAlgebraic Coding Theory
Quasi-twisted codes of fixed index >1 have been shown recently to be asymptotically good (A. Alahmadi, C. Güneri, H. Shoaib, P. Solé, 2017). We use this result to construct asymptotically good additive constacyclic codes on any extension of a fixed degree of the base field. A similar result is proved for additive cyclic codes under Artin conjecture on primitive roots.
19
Quantum error correction via codes over GF(4)
A.R. Calderbank, Eric M. Rains, Peter Shor et al. · IEEE Transactions on Information Theory · 1998 · 1.7K citations
J�rgen Bierbrauer, Yves Edel · Journal of Combinatorial Designs · 2000 · 163 citations