Answers are grounded in this paper and cite their sources.
This analysis demonstrates hermitian lcd 2-quasi-abelian codes in finite fields, indicating their asymptotic performance in finite chain rings.
This paper introduces a class of Hermitian LCD 2-quasi-abelian codes over finite fields and presents a comprehensive enumeration of these codes in which relative minimum weights are small. We show that such codes can achieve asymptotically good over finite fields. Furthermore, we extend our analysis to finite chain rings by characterizing 2-quasi-abelian codes in this setting and proving the existence of asymptotically good Hermitian LCD 2-quasi-abelian codes over finite chain rings as well.
No takes yet. Share an insight, caveat, or question.
Bhowmick et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: