Higher weights and graded rings for binary self-dual codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1284416 (Why is no real title available?)
- scientific article; zbMATH DE number 469202 (Why is no real title available?)
- 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
- Support weight distribution of linear codes
- The biweight enumerator of self-orthogonal binary codes
Cited in
(9)- On higher weights and code existence
- On the cycle index and the weight enumerator
- Higher weights for ternary and quaternary self-dual codes*
- Higher weights and binary self-dual codes
- An example of an infinitely generated graded ring motivated by coding theory
- Higher weights for codes over rings
- Support weight enumerators and coset weight distributions of isodual codes
- ON THE SUPPORT WEIGHT DISTRIBUTION OF LINEAR CODES OVER THE RING
- Generalized minimum distance functions
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)