Second support weights for binary self-dual codes

Authors:
Keisuke Shiromoto
Affiliations:
Department of Information Systems, Aichi Prefectural University, Aichi, Japan
Venue:
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Year:
2005

Citing 7
Cited 0

Support weight distribution of linear codes

Discrete Mathematics - A collection of contributions in honour of Jack van Lint
Trellis Structure and Higher Weights of Extremal Self-Dual Codes

Designs, Codes and Cryptography
Handbook of Coding Theory

Handbook of Coding Theory
The Weight Enumerator of Linear Codes over GF (q^m) Having Generator Matrix over GF (q)

Designs, Codes and Cryptography
On a 5-design related to an extremal doubly even self-dual code of length 72

Journal of Combinatorial Theory Series A
Geometric approach to higher weights

IEEE Transactions on Information Theory - Part 1
The third support weight enumerators of the doubly-even, self-dual [32,16,8] codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.