Abstract
With the help of a computer, we obtain the minimum distance of some codes belonging to two families of ℤ2 k-linear codes: the first is the generalized Kerdock codes which aren’t as good as the best linear codes and the second is the Hensel lift of quadratic residue codes. In the latter, we found new codes with same minimum distances as the best linear codes of same length and same cardinality. We give a construction of binary codes starting with a ℤ2 k-linear code and adding cosets to it, increasing its cardinality and keeping the same minimum distance. This construction allows to derive a non trivial upper bound on cardinalities of ℤ2 k-linear Codes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hammons, R., Kumar, P., Calderbank, A., Sloane, N., Solé, P.: Kerdock, Preparata, Goethals and other codes are linear over ℤ4. IEEE Transactions on Information Theory IT-40 (1994) 301–319
Nechaev, A.: Kerdock codes in a cyclic form. Discrete Mathematics and Applications 1 (1991) 365–384 (Translated from russian, Diskretnaya Matematika, vol. 1, no 4, 1989, pp. 123–139).
Constantinescu, I., Heise, W.: A metric for codes over residue class rings. Problems of Information Transmission 33 (1997) 208–213 (Translated from russian, Problemy Peredachi Informatsii, vol. 33, No. 3, 1997, pp. 22–28).
Carlet, C.: ℤ2 k-linear codes. IEEE Transactions on Information Theory IT-44 (1998) 1543–1547
Bonnecaze, A., Solé, P., Calderbank, A.: Quaternary quadratic residue codes and unimodular lattices. IEEE Transactions on Information Theory IT-41 (1995) 366–377
Pless, V., Qian, Z.: Cyclic codes and quadratic residue codes over ℤ4. IEEE Transactions on Information Theory IT-42 (1996) 1594–1600
Calderbank, A., McGuire, G., Kumar, P., Helleseth, T.: Cyclic codes over ℤ4, locator polynomials and Newton’s identities. IEEE Transactions on Information Theory IT-42 (1996) 217–226
Duursma, I., Greferath, M., Litsyn, S., Schmidt, S.: A ℤ8-linear lift of the binary Golay code and a non-linear binary (96, 237, 24) code. IEEE Transactions on Information Theory IT-47 (2001) 1596–1598
MacDonald, B.: Finite Rings with Identity. Dekker (1974)
Calderbank, A., Sloane., N.: Modular and p-adic cylic codes. Designs, Codes and Cryptography 6 (1995) 21–35
Kanwar, P., López-Permouth, S.: Cyclic codes over the integers modulo p m. Finite Fields and Their Applications (1997) 334–352
Galand, F.: Codes ℤ2 k-lineaires. Technical report, (INRIA) To appear.
Brouwer, A.: Bounds on the Size of Linear Codes. In: Handbook of Coding Theory. Volume 1. North-Holland (1998) 295–461. (http://www.win.tue.nl/~aeb/voorlincod.html).
Dumer, I.: Concatened Codes and Their Multilevel Generalizations. In: Handbook of Coding Theory. Vol. 2. North-Holland (1998) 1911–1988
MacWilliams, F., Sloane, N.: The Theory of Error-Correcting Codes. 3rd ed. North-Holland (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galand, F. (2003). On the Minimum Distance of Some Families of ℤ2 k-Linear Codes. In: Fossorier, M., Høholdt, T., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2003. Lecture Notes in Computer Science, vol 2643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44828-4_25
Download citation
DOI: https://doi.org/10.1007/3-540-44828-4_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40111-7
Online ISBN: 978-3-540-44828-0
eBook Packages: Springer Book Archive