Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Designs, Codes and Cryptography
Published in: Designs, Codes and Cryptography 2/2014

01-08-2014

\(\mathbb{Z }_2\mathbb{Z }_4\)-Additive formally self-dual codes

Authors: S. T. Dougherty, C. Fernández-Córdoba

Published in: Designs, Codes and Cryptography | Issue 2/2014

Login to get access

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

search-config
loading …

Abstract

We study odd and even \(\mathbb{Z }_2\mathbb{Z }_4\) formally self-dual codes. The images of these codes are binary codes whose weight enumerators are that of a formally self-dual code but may not be linear. Three constructions are given for formally self-dual codes and existence theorems are given for codes of each type defined in the paper.
previous article New sets of frequency-hopping sequences with optimal Hamming correlation
next article Transitive -invariant 42-arcs in 3-dimensional projective spaces
Literature
1.
Bannai E., Dougherty S.T., Harada M., Oura M.: Type II codes, even unimodular lattices, and invariant rings. IEEE Trans. Inf. Theory 45(4), 1194–1205 (1999).
2.
Bierbrauer J.: Introduction to Coding Theory. Chapman & Hall, New York (2005).
3.
Blokhuis A., Brouwer A.E.: Small additive quaternary codes. Eur. J. Comb. 25, 161–167 (2004).
4.
Borges J., Rifà J.: A characterization of 1-perfect additive codes. IEEE Trans. Inf. Theory 45(5), 1688–1697 (1999).
5.
Borges J., Fernández-Córdoba C., Pujol J., Rifà J., Villanueva M.: On \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes and duality. In: V Jornades de Matemàtica Discreta i Algorísmica, Soria (Spain). 11–14, Jul., pp. 171–177 (2006).
6.
Borges J., Fernández-Córdoba C., Pujol J., Rifà J., Villanueva M.: \({\mathbb{Z}}_{2} {\mathbb{Z}}_{4}\)-linear codes: generator matrices and duality. Des. Codes Cryptogr. 54(2), 167–179 (2010).
7.
Borges J., Dougherty S.T., Fernández-Córdoba C.: Characterization and constructions of self-dual codes over \(\mathbb{Z}_2 \times \mathbb{Z}_4\). Adv. Math. Commun. 6(3), 287–303 (2012).
8.
Broué M., Enguehard M.: Polynômes des poids de certains codes et fonctions thêta de certains réseaux”. Ann. Sci. École Norm. Sup. 5(4), 157–181 (1972).
9.
Brualdi R.A., Pless V.S.: Weight enumerators of self-dual codes. IEEE Trans. Inf. Theory IT-37, 1222–1225 (1991).
10.
Conway J.H., Sloane N.J.A.: A new upper bound on the minimal distance of self-dual codes. IEEE Trans. Inf. Theory 36(6), 1319–1333 (1990).
11.
Conway J.H., Sloane N.J.A.: Self-dual codes over the integers modulo 4. J. Comb. Theory Ser. A 62, 30–45 (1993).
12.
Conway J.H., Sloane N.J.A.: Sphere Packings, Lattices and Groups, 3rd edn. Springer, Berlin (1999).
13.
Delsarte P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. 10 (1973).
14.
Delsarte P., Levenshtein V.: Association schemes and coding theory. IEEE Trans. Inf. Theory 44(6), 2477–2504 (1998).
15.
Dougherty S.T.: Shadow codes and their weight enumerators. IEEE Trans. Inf. Theory 41(3) (1995).
16.
Dougherty S.T.: Formally self-dual codes and gray maps. In: Proceedings of ACCT2012, Pomorie Bulgaria (2012).
17.
Dougherty S.T., Fernandez-Cordoba C.: Codes over \(\mathbb{Z}_{2^k}\), gray maps and self-dual codes. Adv. Math. Commun. 5(4), 571–588 (2011).
18.
Dougherty S.T., Solé P.: Shadow constructions of unimodular lattices and self-dual codes. In: Sunada T., Sy B.W., Lo Y. (eds.) AMC, pp. 139–152. World Scientific, Singapore (2002).
19.
Dougherty S.T., Kim J.-L., Liu H.: Constructions of self-dual codes over finite commutative chain rings. Int. J. Inf. Coding Theory 1(2), 171–190 (2010).
20.
Dougherty S.T., Kim J.-L., Kulosman H., Liu H.: Self-dual codes over commutative Frobenius rings. Finite Fields Appl. 16(1), 14–26 (2010).
21.
Fernández-Córdoba C., Pujol J., Villanueva M.: \(\mathbb{Z}_2\mathbb{Z}_4\)-linear codes: rank and kernel. Des. Codes Cryptogr. 56(1), 43–59 (2010).
22.
Gleason A. M.: Weight polynomials of self-dual codes and the MacWilliams identities. Actes du Congrs International des Mathmaticiens (Nice, 1970), Tome 3, pp. 211–215. Gauthier-Villars, Paris (1971).
23.
Hammons A.R., Kumar P.V., Calderbank A.R., Sloane N.J.A., Solé P.: The \(\mathbb{Z}_4\)-linearity of kerdock, preparata, goethals and related codes. IEEE Trans. Inf. Theory 40(2), 301–319 (1994).
24.
Han S., Lee H., Lee Y.: Binary Formally Self-Dual Odd Codes. Des. Codes Cryptogr. 61, 141–150 (2011).
25.
Kim J.-L., Pless V.: Designs in additive codes over GF(4). Des. Codes Cryptogr. 30, 187–199 (2003).
26.
MacWilliams F.J., Sloane N.J.A.: The Theory of Error-correcting Codes. North-Holland Mathematical Library, vol. 16. North-Holland, Amsterdam (1977).
27.
Odlyzko A.M., Sloane N.J.A.: A theta-function identity for nonlattice packings. Stud. Sci. Math. Hungarica 5, 461–465 (1980).
28.
Phelps K.T., Rifà J.: On binary 1-perfect additive codes: some structural properties. IEEE Trans. Inf. Theory 48(9), 2587–2592 (2002).
29.
Pujol J., Rifà J.: Translation invariant propelinear codes. IEEE Trans. Inf. Theory 43, 590–598 (1997).
30.
Rains E., Sloane N.J.A.: Self-dual codes. In: Pless V.S., Huffman W.C. (eds.) The Handbook of Coding Theory, pp. 177–294. Elsevier, Amsterdam (1998).
31.
Ward H.N.: A restriction on the weight enumerator of a self-dual code. J. Comb. Theory Ser. A 21, 253–255 (1976).
Metadata
Title
-Additive formally self-dual codes
Authors
S. T. Dougherty
C. Fernández-Córdoba
Publication date
01-08-2014
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 2/2014
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-012-9773-4

Other articles of this Issue 2/2014

Designs, Codes and Cryptography 2/2014 Go to the issue

OriginalPaper

Combinatorial solutions providing improved security for the generalized Russian cards problem

OriginalPaper

Constructing differentially 4-uniform permutations over GF(22m ) from quadratic APN permutations over GF(22m+1)

OriginalPaper

Boolean functions with MacWilliams duality

OriginalPaper

The multicovering radius problem for some types of discrete structures

OriginalPaper

Relative one-weight linear codes

OriginalPaper

Double k-sets in symplectic generalized quadrangles

Premium Partner

    Image Credits