A lemma on binomial coefficients and applications to Lee weights modulo \(2^e\) of codes over \(\mathbb Z_4\)
From MaRDI portal
Publication:690660
DOI10.1007/S10623-011-9512-2zbMath1259.94074OpenAlexW2064602715WikidataQ124829129 ScholiaQ124829129MaRDI QIDQ690660
Publication date: 28 November 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9512-2
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Theory of error-correcting codes and error-detecting codes (94B99) Finite commutative rings (13M99)
Cites Work
- A lemma on polynomials modulo \(p^m\) and applications to coding theory
- Divisible codes
- Constraints on weights in binary codes
- Weights modulo \(p^e\) of linear codes over rings
- Restrictions on the weight distribution of binary linear codes imposed by the structure of Reed-Muller codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Decompositions and extremal type II codes over Z/sub 4/
This page was built for publication: A lemma on binomial coefficients and applications to Lee weights modulo \(2^e\) of codes over \(\mathbb Z_4\)
