Characterization and Enumeration of Complementary Dual Abelian Codes

2017/10/13 by Arunwan Boripan, Boripan, Arunwan, Somphong Jitman +3 · 1 citation
Computer Science · Engineering · #Coding theory and cryptography #Cryptographic Implementations and Security #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1710.04986

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 \mathbbF_p^ν[G] has been studied under both the Euclidean and Hermitian inner products, where p is a prime, ν is a positive integer, and G 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 \mathbbF_p^ν[G] has been shown to be independent of the Sylow p-subgroup of G and it has been completely determined for every finite abelian group G. 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.

Cited by

• Good Integers: A Comprehensive Review with Applications

Related

• Self-Dual and Complementary Dual Abelian Codes over Galois Rings
• Self-Dual Abelian Codes in some Non-Principal Ideal Group Algebras
• A Note on Linear Complementary Pairs of Group Codes
• On the Existence of Hermitian Self-Dual Extended Abelian Group Codes
• Classification and count of binary linear complementary dual group codes