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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Shiromoto, K. (2006). Second support weights for binary self-dual codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3969 LNCS, pp. 1–13). Springer Verlag. https://doi.org/10.1007/11779360_1
Mendeley helps you to discover research relevant for your work.