Higher weights and graded rings for binary self-dual codes
- 15 May 2003
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 128 (1) , 121-143
- https://doi.org/10.1016/s0166-218x(02)00440-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Extremal binary self-dual codesIEEE Transactions on Information Theory, 1997
- Geometric approach to higher weightsIEEE Transactions on Information Theory, 1995
- Algorithms in Invariant TheoryPublished by Springer Nature ,1993
- Support weight distribution of linear codesDiscrete Mathematics, 1992
- Generalized Hamming weights for linear codesIEEE Transactions on Information Theory, 1991
- A new upper bound on the minimal distance of self-dual codesIEEE Transactions on Information Theory, 1990
- The biweight enumerator of self-orthogonal binary codesDiscrete Mathematics, 1979
- Generalizations of Gleason's theorem on weight enumerators of self-dual codesIEEE Transactions on Information Theory, 1972