Hermitian LCD 2-Quasi Abelian Codes over Finite Chain Rings

Abstract

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 are 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…