A lemma on binomial coefficients and applications to Lee weights modulo 2e of codes over Z₄
From MaRDI portal
(Redirected from Publication:690660)
A lemma on binomial coefficients and applications to Lee weights modulo \(2^e\) of codes over \(\mathbb Z 4\)
A lemma on binomial coefficients and applications to Lee weights modulo \(2^e\) of codes over \(\mathbb Z 4\)
Recommendations
- On the extended Lee weights modulo \(2^e\) of linear codes over \(\mathbb{Z}_{2^s}\).
- On codes over Zps with the extended lee weight
- A note on a basic exact sequence for the Lee and Euclidean weights of linear codes over \(\mathbb{Z}_\ell\)
- A basic exact sequence for the Lee and Euclidean weights of linear codes over \(\mathbb{Z}_l\)
- A lemma on polynomials modulo \(p^m\) and applications to coding theory
- On one-Lee weight and two-Lee weight \(\mathbb{Z}_2\mathbb{Z}_4[u]\) additive codes and their constructions
- Optimal binary codes from one-Lee weight codes and two-Lee weight projective codes over \(\mathbb Z_4\)
- On the weight hierarchy of Kerdock codes over Z/sub 4/
- Publication:4470464
- Generalized Lee weight MacWilliams identities for \(Z_4\)-linear codes
Cites work
- A lemma on polynomials modulo \(p^m\) and applications to coding theory
- Constraints on weights in binary codes
- Decompositions and extremal type II codes over Z/sub 4/
- Divisible codes
- 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
- Weights modulo \(p^e\) of linear codes over rings
Cited in
(3)
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\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690660)
