Higher weights and graded rings for binary self-dual codes

DOI10.1016/S0166-218X(02)00440-7MaRDI QIDQ1811098zbMATH OpenOpenAlexFDO

Authors Steven T. Dougherty, T. Aaron Gulliver, 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

Binary self-dual codesgraded ringsHamming weightHigher weightsminimum weightsoptimal codesweight enumerator

Mathematics Subject Classification ID

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

Review text

The theory of higher weights, which is a generalization of the Hamming weight, is applied to binary self-dual codes. Bounds are derived for the second minimum higher weight and a Gleason-type theorem is obtained for the second higher weight enumerator. The second weight enumerator is shown to be unique for the putative Type II code, and the first three minimum weights are computed for optimal codes of length less than 32. The authors also determine the structures of the graded rings associated with the code polynomials of higher weights for small genera.

Recommendations

• Higher weights and binary self-dual codes
• Codes and Siegel modular forms
• Higher weights for ternary and quaternary self-dual codes*
• Higher weights and generalized MDS codes
• Higher weights for codes over rings

Cites work

• A new upper bound on the minimal distance of self-dual codes
• Algorithms in invariant theory
• Extremal binary self-dual codes
• Generalizations of Gleason's theorem on weight enumerators of self-dual codes
• Generalized Hamming weights for linear codes
• Geometric approach to higher weights
• scientific article; zbMATH DE number 1284416 (Why is no real title available?)
• scientific article; zbMATH DE number 469202 (Why is no real title available?)
• Support weight distribution of linear codes
• The biweight enumerator of self-orthogonal binary codes

Cited in

(9)

• An example of an infinitely generated graded ring motivated by coding theory
• Generalized minimum distance functions
• On the cycle index and the weight enumerator
• Higher weights for ternary and quaternary self-dual codes*
• Support weight enumerators and coset weight distributions of isodual codes
• Higher weights and binary self-dual codes
• ON THE SUPPORT WEIGHT DISTRIBUTION OF LINEAR CODES OVER THE RING
• On higher weights and code existence
• Higher weights for codes over rings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811098)