A lemma on polynomials modulo \(p^m\) and applications to coding theory
From MaRDI portal
Publication:856866
DOI10.1016/j.disc.2004.10.030zbMath1156.11009OpenAlexW2067365716WikidataQ124844373 ScholiaQ124844373MaRDI QIDQ856866
Publication date: 14 December 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.10.030
Factorials, binomial coefficients, combinatorial functions (05A10) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Polynomials over finite fields (11T06) Sequences (mod (m)) (11B50)
Related Items (11)
Functional degrees and arithmetic applications. I: The set of functional degrees ⋮ Divisibility on point counting over finite Witt rings ⋮ An equivalence of Ward's bound and its application ⋮ Zeros of polynomials over finite Witt rings ⋮ Chevalley-Warning type results on abelian groups ⋮ A lemma on binomial coefficients and applications to Lee weights modulo \(2^e\) of codes over \(\mathbb Z_4\) ⋮ On theorems of Delsarte-McEliece and Chevalley-Warning-Ax-Katz ⋮ Classification of polynomial mappings between commutative groups. ⋮ Divisibility of exponential sums via elementary methods ⋮ A generalized Gleason-Pierce-Ward theorem ⋮ Proof of the list edge coloring conjecture for complete graphs of prime degree
Cites Work
- Unnamed Item
- A divisibility property for Stirling numbers
- Weight congruence for p-ary cyclic codes
- Zeros of Functions in Finite Abelian Group Algebras
- Restrictions on the weight distribution of binary linear codes imposed by the structure of Reed-Muller codes
- A Chevalley-Warning Approach To p-Adic Estimates of Character Sums
- A 2-adic approach to the analysis of cyclic codes
- On a Theorem of Ax
- Zeroes of Polynomials Over Finite Fields
This page was built for publication: A lemma on polynomials modulo \(p^m\) and applications to coding theory
