Designs, Codes and Cryptography

, Volume 74, Issue 3, pp 511–531 | Cite as

Quasi-abelian codes

  • Somphong JitmanEmail author
  • San Ling


We study \(H\)-quasi-abelian codes in \(\mathbb F _q[G]\), where \(H\le G\) are abelian groups such that \(\gcd (|H|,q)=1\). Such codes are generalizations of quasi-cyclic codes and can be viewed as linear codes over the group ring \(\mathbb F _q[H]\). Using the Discrete Fourier Transform, \(\mathbb F _q[H]\) can be decomposed as a direct product of finite fields. This decomposition leads us to a structural characterization of quasi-abelian codes and their duals. Necessary and sufficient conditions for such codes to be self-dual are given together with the enumeration based on \(q\)-cyclotomic classes of \(H\). In particular, when \(H\) is an elementary \(p\)-group, we characterize the \(q\)-cyclotomic classes of \(H\) and give an explicit formula for the number of self-dual \(H\)-quasi abelian codes. Analogous to 1-generator quasi-cyclic codes, we investigate the structural characterization and enumeration of 1-generator quasi-abelian codes. We show that the class of binary self-dual (strictly) quasi-abelian codes is asymptotically good. Finally, we present four strictly quasi-abelian codes and ten codes obtained by puncturing and shortening of these codes, whose minimum distances are better than the lower bound in Grassl’s online table.


Quasi-abelian codes Group algebras Discrete Fourier transform  Self-dual codes 1-Generator quasi-abelian codes 

Mathematics Subject Classification

94B15 94B60 16A26 



The authors would like to thank the anonymous referees for helpful comments and suggestions. This research was supported by the National Research Foundation of Singapore under Research Grant NRF-CRP2-2007-03.


  1. 1.
    Bazzi L.M.J., Mitter S.K.: Some randomized code constructions from group actions. IEEE Trans. Inf. Theory 52, 3210–3219 (2006).Google Scholar
  2. 2.
    Berman S.D.: Semi-simple cyclic and abelian codes. Kibernetika 3, 21–30 (1967).Google Scholar
  3. 3.
    Berman S.D.: On the theory of group codes. Kibernetika 3, 31–39 (1967).Google Scholar
  4. 4.
    Bosma W., Cannon J.J., Playoust C.: The magma algebra system. I: the user language. J. Symb. Comput. 24, 235–266 (1997).Google Scholar
  5. 5.
    Dey B.K., Rajan B.S.: Codes closed under arbitrary abelian group of permutations. SIAM J. Discret. Math. 18, 1–18 (2004).Google Scholar
  6. 6.
    Ding C., Kohel D.R., Ling S.: Split group codes. IEEE Trans. Inf. Theory 46, 485–495 (2000).Google Scholar
  7. 7.
    Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. Accessed 25 April 2013.
  8. 8.
    Jitman S.: Generator matrices for new quasi-abelian codes. Accessed 25 April 2013.
  9. 9.
    Lally K., Fitzpatrick P.: Algebraic structure of quasicyclic codes. Discret. Appl. Math. 111, 157–175 (2001).Google Scholar
  10. 10.
    Ling S., Solé P.: On the algebraic structure of quasi-cyclic codes. I: finite fields. IEEE Trans. Inf. Theory 47, 2751–2760 (2001).Google Scholar
  11. 11.
    Ling S., Solé P.: Good self-dual quasi-cyclic codes exist. IEEE Trans. Inf. Theory 49, 1052–1053 (2003).Google Scholar
  12. 12.
    Ling S., Solé P.: On the algebraic structure of quasi-cyclic codes. III: generator theory. IEEE Trans. Inf. Theory 51, 2692–2700 (2005).Google Scholar
  13. 13.
    Ling S., Xing C.: Polyadic codes revisited. IEEE Trans. Inf. Theory 50, 200–207 (2004).Google Scholar
  14. 14.
    MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977).Google Scholar
  15. 15.
    Martínez-Pérez C., Willems W.: Self-dual doubly even 2-quasi-cyclic transitive codes are asymptotically good. IEEE Trans. Inf. Theory 53, 4302–4308 (2007).Google Scholar
  16. 16.
    Pei J., Zhang X.: 1-Generator quasi-cyclic codes. J. Syst. Sci. Complex 20, 554–561 (2007).Google Scholar
  17. 17.
    Pless V.: On the uniqueness of the Golay codes. J. Comb. Theory 5, 215–228 (1968).Google Scholar
  18. 18.
    Rains E.M., Sloane N.J.A.: Self-dual codes. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, pp. 177–294. North-Holland, Amsterdam (1998).Google Scholar
  19. 19.
    Séguin G.: A class of 1-generator quasi-cyclic codes. IEEE Trans. Inf. Theory 50, 1745–1753 (2004).Google Scholar
  20. 20.
    Wasan S.K.: Quasi abelian codes. Publ. Inst. Math. 35, 201–206 (1977).Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Department of Mathematics, Faculty of ScienceSilpakorn UniversityNakhon PathomThailand
  2. 2.Division of Mathematical Sciences, School of Physical and Mathematical SciencesNanyang Technological UniversitySingaporeRepublic of Singapore

Personalised recommendations