Higher weights and graded rings for binary self-dual codes

DOI10.1016/S0166-218X(02)00440-7zbMath1029.94036OpenAlexW2011959959MaRDI QIDQ1811098

T. Aaron Gulliver, Steven T. Dougherty, Manabu Oura

Publication date: 10 June 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00440-7

zbMATH Keywords

weight enumeratorgraded ringsHamming weightoptimal codesminimum weightsBinary self-dual codesHigher weights

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Related Items (5)

On the cycle index and the weight enumerator ⋮ ON THE SUPPORT WEIGHT DISTRIBUTION OF LINEAR CODES OVER THE RING ⋮ An example of an infinitely generated graded ring motivated by coding theory ⋮ Higher weights for ternary and quaternary self-dual codes* ⋮ Support weight enumerators and coset weight distributions of isodual codes

Cites Work

• Unnamed Item
• Unnamed Item
• The biweight enumerator of self-orthogonal binary codes
• Support weight distribution of linear codes
• A new upper bound on the minimal distance of self-dual codes
• Generalized Hamming weights for linear codes
• Extremal binary self-dual codes
• Geometric approach to higher weights
• Generalizations of Gleason's theorem on weight enumerators of self-dual codes
• Algorithms in invariant theory

This page was built for publication: Higher weights and graded rings for binary self-dual codes