English

Characterization and Enumeration of Complementary Dual Abelian Codes

Information Theory 2017-10-16 v1 math.IT Rings and Algebras

Abstract

Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary dual in a group algebra Fpν[G]\mathbb{F}_{p^\nu}[G] has been studied under both the Euclidean and Hermitian inner products, where pp is a prime, ν\nu is a positive integer, and GG is an arbitrary finite abelian group. Based on the discrete Fourier transform decomposition for semi-simple group algebras and properties of ideas in local group algebras, the characterization of such codes have been given. Subsequently, the number of complementary dual abelian codes in Fpν[G]\mathbb{F}_{p^\nu}[G] has been shown to be independent of the Sylow pp-subgroup of GG and it has been completely determined for every finite abelian group GG. In some cases, a simplified formula for the enumeration has been provided as well. The known results for cyclic complementary dual codes can be viewed as corollaries.

Keywords

Cite

@article{arxiv.1710.04986,
  title  = {Characterization and Enumeration of Complementary Dual Abelian Codes},
  author = {Arunwan Boripan and Somphong Jitman and Patanee Udomkavanich},
  journal= {arXiv preprint arXiv:1710.04986},
  year   = {2017}
}
R2 v1 2026-06-22T22:12:57.936Z