Abstract
In this work, we investigate the second generalized Hamming weights for binary doubly-even self-dual codes from the point of view of corresponding t-designs by the Assmus-Mattson theorem. In particular, for extremal doubly-even self-dual codes, we shall give a bound on the weights and determine the weights by using the block intersection numbers of corresponding t-designs. Moreover we study the support weight enumerators for binary doubly-even self-dual codes and determine the second support weight enumerators for binary extremal doubly-even self-dual codes of length 56 and 96.
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
Assmus, E.F., Mattson, H.F.: New 5-designs. Journal of Combinatorial Theory 6, 122–151 (1969)
Chen, H., Coffey, J.T.: Trellis structure and higher weights of extremal self-dual codes. Designs, Codes and Cryptography 24, 15–36 (2001)
Dougherty, S.T., Gulliver, T.A.: Higher weights and binary self-dual codes. In: Proceedings of the International Workshop on Coding and Cryptography, Paris, France, pp. 177–188 (2001)
Harada, M., Kitazume, M., Munemasa, A.: On a 5-designs related to an extremal doubly even self-dual code of length 72. Journal of Combinatorial Theory A 107, 143–146 (2004)
Helleseth, T., Kløve, T., Mykkeltveit, J.: The weight distribution of irreducible cyclic codes with block length \(n_1 ((q^l-1)/N)\). Discrete Mathematics 18, 179–211 (1977)
Huffman, W.C., Pless, V.S.: Fundamentals of Error-Correcting Codes, Cambridge (2003)
Kløve, T.: The weight distribution of linear codes over GF(q l) having generator matrix over GF(q). Discrete Mathematics 106/107, 311–316 (1992)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)
Mallows, C.L., Sloane, N.J.A.: An upper bound for self-dual codes. Inform. Contr. 22, 188–200 (1973)
Mendelsohn, N.S.: Intersection numbers of t-designs. Studies in Pure Mathematics, pp. 145–150. Academic Press, London (1971)
Milenkovic, O., Coffey, S.T., Compton, K.J.: The third support weight enumerators of the doubly-even, self-dual [32,16,8] codes. IEEE Trans. Inform. Theory 49, 740–746 (2003)
Pless, V.S., Huffman, W.C. (eds.): Handbook of Coding Theory. North-Holland, Amsterdam (1998)
Shiromoto, K.: The weight enumerator of linear codes over GF(q m) having generator matrix over GF(q). Designs, Codes and Cryptography 16, 87–92 (1999)
Tonchev, V.D.: A characterization of designs related to the Witt system S(5,8,24). Math. Z. 191, 225–230 (1986)
Tsfasman, M.A., Vlădut, S.G.: Geometric approach to higher weights. IEEE Trans. Inform. Theory 41, 1564–1588 (1995)
Wei, V.K.: Generalized Hamming weights for linear codes. IEEE Trans. Inform. Theory 37, 1412–1418 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shiromoto, K. (2006). Second Support Weights for Binary Self-dual Codes. In: Ytrehus, Ø. (eds) Coding and Cryptography. WCC 2005. Lecture Notes in Computer Science, vol 3969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779360_1
Download citation
DOI: https://doi.org/10.1007/11779360_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35481-9
Online ISBN: 978-3-540-35482-6
eBook Packages: Computer ScienceComputer Science (R0)