Weights modulo \(p^e\) of linear codes over rings
From MaRDI portal
Publication:2384022
DOI10.1007/s10623-007-9076-3zbMath1150.94012MaRDI QIDQ2384022
Publication date: 20 September 2007
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9076-3
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94B05: Linear codes (general theory)
Related Items
A lemma on binomial coefficients and applications to Lee weights modulo \(2^e\) of codes over \(\mathbb Z_4\), A combinatorial construction of the Gray map over Galois rings, A MacWilliams type identity on Lee weight for linear codes over \(\mathbb F_2 + u\mathbb F_2^\ast\)
Cites Work
- Unnamed Item
- Unnamed Item
- A metric for codes over residue class rings
- Constraints on weights in binary codes
- Homogeneous weights and exponential sums.
- Type II codes over \(\mathbb{F}_{2^m} + u\mathbb{F}_{2^m}\)
- An Improvement on the Bounds of Weil Exponential Sums Over Galois Rings With Some Applications
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Decompositions and extremal type II codes over Z/sub 4/
- Type IV self-dual codes over rings
- Z/sub 2/k-linear codes
- Type II codes over F/sub 2/+uF/sub 2/
- An upper bound for Weil exponential sums over Galois rings and applications
