Characterization and enumeration of complementary dual abelian codes

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 $${\mathbb {F}}_{p^\nu }[G]$$Fpν[G] has been studied under both the Euclidean and Hermitian inner products, where p is a prime, $$\nu $$ν 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 $${\mathbb {F}}_{p^\nu }[G]$$Fpν[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.

[1]  Hervé Chabanne,et al.  Permutation decoding of Abelian codes , 1992, IEEE Trans. Inf. Theory.

[2]  James L. Massey,et al.  Linear codes with complementary duals , 1992, Discret. Math..

[3]  E. Marti´nez-Moro Multivariable Codes Over Finite Chain Rings: Serial Codes , 2006 .

[4]  Werner Henkel,et al.  LCD Codes and Iterative Decoding by Projections, a First Step Towards an Intuitive Description of Iterative Decoding , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[5]  Sergio R. López-Permouth,et al.  Cyclic and negacyclic codes over finite chain rings , 2004, IEEE Transactions on Information Theory.

[6]  Patrick Solé,et al.  Hermitian Self-Dual Abelian Codes , 2014, IEEE Transactions on Information Theory.

[7]  Steve Benson,et al.  Students Ask the Darnedest Things: A Result in Elementary Group Theory , 1997 .

[8]  Sylvain Guilley,et al.  Linear complementary dual code improvement to strengthen encoded circuit against hardware Trojan horses , 2015, 2015 IEEE International Symposium on Hardware Oriented Security and Trust (HOST).

[9]  Mohammad Umar Siddiqi,et al.  Transform domain characterization of Abelian codes , 1992, IEEE Trans. Inf. Theory.

[10]  W. K. Nicholson Local Group Rings , 1972, Canadian Mathematical Bulletin.

[11]  T. Aaron Gulliver,et al.  Constructions of good entanglement-assisted quantum error correcting codes , 2016, Designs, Codes and Cryptography.

[12]  Yuval Ishai,et al.  Private Circuits: Securing Hardware against Probing Attacks , 2003, CRYPTO.

[13]  Sylvain Guilley,et al.  Encoding the state of integrated circuits: a proactive and reactive protection against hardware Trojans horses , 2014, WESS '14.

[14]  Nicolas Sendrier,et al.  Linear codes with complementary duals meet the Gilbert-Varshamov bound , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[15]  Pieter Moree On the divisors of $a^k + b^k$ , 1997 .

[16]  Lola Thompson,et al.  On the divisors of xn-1xn-1 , 2013, Electron. Notes Discret. Math..

[17]  Cunsheng Ding,et al.  Split group codes , 2000, IEEE Trans. Inf. Theory.

[18]  Somphong Jitman,et al.  Hermitian self-dual quasi-abelian codes , 2018 .

[19]  San Ling,et al.  Quasi-abelian codes , 2015, Des. Codes Cryptogr..

[20]  Claude Carlet,et al.  Optimized linear complementary codes implementation for hardware trojan prevention , 2015, 2015 European Conference on Circuit Theory and Design (ECCTD).

[21]  Hongwei Liu,et al.  Abelian Codes in Principal Ideal Group Algebras , 2013, IEEE Transactions on Information Theory.

[22]  José Joaquín Bernal,et al.  Information Sets From Defining Sets in Abelian Codes , 2011, IEEE Transactions on Information Theory.

[23]  Claude Carlet,et al.  Complementary dual codes for counter-measures to side-channel attacks , 2016, Adv. Math. Commun..

[24]  Xiang Yang,et al.  The condition for a cyclic code to have a complementary dual , 1994, Discret. Math..

[25]  Roberta Evans Sabin,et al.  On Determining All Codes in Semi-Single Group Rings , 1993, AAECC.