Characterization and enumeration of complementary dual abelian codes

From MaRDI portal
Publication:1786972

DOI10.1007/S12190-017-1155-7zbMATH Open1414.94931arXiv1710.04986OpenAlexW2766685446WikidataQ62577973 ScholiaQ62577973MaRDI QIDQ1786972FDOQ1786972

Patanee Udomkavanich, Somphong Jitman, Arunwan Boripan

Publication date: 25 September 2018

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

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 mathbbFpu[G] has been studied under both the Euclidean and Hermitian inner products, where p is a prime, u 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 mathbbFpu[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.


Full work available at URL: https://arxiv.org/abs/1710.04986




Recommendations




Cites Work


Cited In (13)





This page was built for publication: Characterization and enumeration of complementary dual abelian codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786972)