Skip to main content
Top
Published in: Designs, Codes and Cryptography 3/2015

01-03-2015

Quasi-abelian codes

Authors: Somphong Jitman, San Ling

Published in: Designs, Codes and Cryptography | Issue 3/2015

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

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.
Literature
1.
go back to reference Bazzi L.M.J., Mitter S.K.: Some randomized code constructions from group actions. IEEE Trans. Inf. Theory 52, 3210–3219 (2006). Bazzi L.M.J., Mitter S.K.: Some randomized code constructions from group actions. IEEE Trans. Inf. Theory 52, 3210–3219 (2006).
2.
go back to reference Berman S.D.: Semi-simple cyclic and abelian codes. Kibernetika 3, 21–30 (1967). Berman S.D.: Semi-simple cyclic and abelian codes. Kibernetika 3, 21–30 (1967).
3.
go back to reference Berman S.D.: On the theory of group codes. Kibernetika 3, 31–39 (1967). Berman S.D.: On the theory of group codes. Kibernetika 3, 31–39 (1967).
4.
go back to reference Bosma W., Cannon J.J., Playoust C.: The magma algebra system. I: the user language. J. Symb. Comput. 24, 235–266 (1997). Bosma W., Cannon J.J., Playoust C.: The magma algebra system. I: the user language. J. Symb. Comput. 24, 235–266 (1997).
5.
go back to reference Dey B.K., Rajan B.S.: Codes closed under arbitrary abelian group of permutations. SIAM J. Discret. Math. 18, 1–18 (2004). Dey B.K., Rajan B.S.: Codes closed under arbitrary abelian group of permutations. SIAM J. Discret. Math. 18, 1–18 (2004).
6.
go back to reference Ding C., Kohel D.R., Ling S.: Split group codes. IEEE Trans. Inf. Theory 46, 485–495 (2000). Ding C., Kohel D.R., Ling S.: Split group codes. IEEE Trans. Inf. Theory 46, 485–495 (2000).
9.
go back to reference Lally K., Fitzpatrick P.: Algebraic structure of quasicyclic codes. Discret. Appl. Math. 111, 157–175 (2001). Lally K., Fitzpatrick P.: Algebraic structure of quasicyclic codes. Discret. Appl. Math. 111, 157–175 (2001).
10.
go back to reference Ling S., Solé P.: On the algebraic structure of quasi-cyclic codes. I: finite fields. IEEE Trans. Inf. Theory 47, 2751–2760 (2001). Ling S., Solé P.: On the algebraic structure of quasi-cyclic codes. I: finite fields. IEEE Trans. Inf. Theory 47, 2751–2760 (2001).
11.
go back to reference Ling S., Solé P.: Good self-dual quasi-cyclic codes exist. IEEE Trans. Inf. Theory 49, 1052–1053 (2003). Ling S., Solé P.: Good self-dual quasi-cyclic codes exist. IEEE Trans. Inf. Theory 49, 1052–1053 (2003).
12.
go back to reference Ling S., Solé P.: On the algebraic structure of quasi-cyclic codes. III: generator theory. IEEE Trans. Inf. Theory 51, 2692–2700 (2005). Ling S., Solé P.: On the algebraic structure of quasi-cyclic codes. III: generator theory. IEEE Trans. Inf. Theory 51, 2692–2700 (2005).
13.
go back to reference Ling S., Xing C.: Polyadic codes revisited. IEEE Trans. Inf. Theory 50, 200–207 (2004). Ling S., Xing C.: Polyadic codes revisited. IEEE Trans. Inf. Theory 50, 200–207 (2004).
14.
go back to reference MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977). MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977).
15.
go back to reference 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). 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).
16.
go back to reference Pei J., Zhang X.: 1-Generator quasi-cyclic codes. J. Syst. Sci. Complex 20, 554–561 (2007). Pei J., Zhang X.: 1-Generator quasi-cyclic codes. J. Syst. Sci. Complex 20, 554–561 (2007).
17.
go back to reference Pless V.: On the uniqueness of the Golay codes. J. Comb. Theory 5, 215–228 (1968). Pless V.: On the uniqueness of the Golay codes. J. Comb. Theory 5, 215–228 (1968).
18.
go back to reference 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). 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).
19.
go back to reference Séguin G.: A class of 1-generator quasi-cyclic codes. IEEE Trans. Inf. Theory 50, 1745–1753 (2004). Séguin G.: A class of 1-generator quasi-cyclic codes. IEEE Trans. Inf. Theory 50, 1745–1753 (2004).
20.
go back to reference Wasan S.K.: Quasi abelian codes. Publ. Inst. Math. 35, 201–206 (1977). Wasan S.K.: Quasi abelian codes. Publ. Inst. Math. 35, 201–206 (1977).
Metadata
Title
Quasi-abelian codes
Authors
Somphong Jitman
San Ling
Publication date
01-03-2015
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 3/2015
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-013-9878-4

Other articles of this Issue 3/2015

Designs, Codes and Cryptography 3/2015 Go to the issue

Premium Partner