Hermitian LCD $2$-Quasi Abelian Codes over Finite Chain Rings
By: Sanjit Bhowmick, Kuntal Deka
Potential Business Impact:
Makes computer codes more secure and efficient.
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.
Similar Papers
Linear complementary dual quasi-cyclic codes of index 2
Information Theory
Makes computer codes stronger and harder to break.
Linear Codes with Certain Dimension of Hermitian Hulls
Information Theory
Makes secret codes stronger and easier to find.
LCD and self-orthogonal twisted group codes over finite commutative chain rings
Rings and Algebras
Finds better ways to send secret messages.