Weight distributions of linear codes and the Gleason-Pierce theorem
From MaRDI portal
Publication:1331144
DOI10.1016/0097-3165(94)90004-3zbMath0817.94018OpenAlexW2041112650MaRDI QIDQ1331144
Publication date: 13 August 1995
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(94)90004-3
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Bounds on codes (94B65)
Related Items (3)
Symmetries of weight enumerators and applications to Reed-Muller codes ⋮ A note on formally self-dual even codes of length divisible by 8 ⋮ A generalized Gleason-Pierce-Ward theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quadratic spaces over finite fields and codes
- Center sets and ternary codes
- A restriction on the weight enumerator of a self-dual code
- Self-dual codes over GF(4)
- On designs and formally self-dual codes
- A new upper bound on the minimal distance of self-dual codes
- An updated table of minimum-distance bounds for binary linear codes
- Witt's Extension Theorem for mod Four Valued Quadratic Forms
- The weight-distribution of a coset of a linear code (Corresp.)
- On the coveting radius of extremal self-dual codes
- Four fundamental parameters of a code and their combinatorial significance
This page was built for publication: Weight distributions of linear codes and the Gleason-Pierce theorem