Hermitian LCD 2-quasi abelian codes over finite chain rings
Abstract
This paper introduces a class of Hermitian LCD [Formula: see text]-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 are asymptotically good over finite fields. Furthermore, we extend our analysis to finite chain rings by characterizing [Formula: see text]-quasi-abelian codes in this setting and proving the existence of asymptotically good Hermitian LCD [Formula: see text]-quasi-abelian codes over finite chain rings as well.
Fields of Study & Subjects
Coding theory and cryptography
Rings
Modules
and Algebras
graph theory and CDMA systems
Publication details
- Journal / source
- Journal of Algebra and Its Applications
- Publication date
- 5 January 2026
- Language
- EN