A lemma on polynomials modulo p^m and applications to coding theory
DOI10.1016/J.DISC.2004.10.030zbMATH Open1156.11009OpenAlexW2067365716WikidataQ124844373 ScholiaQ124844373MaRDI QIDQ856866FDOQ856866
Authors: Richard M. Wilson 
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
Recommendations
- On period polynomials of degree \(2^m\) and weight distributions of certain irreducible cyclic codes
- On theorems of Delsarte-McEliece and Chevalley-Warning-Ax-Katz
- <tex>$p$</tex>-Adic Valuation of Weights in Abelian Codes Over<tex>$BBZ_p^d$</tex>
- The weight enumerators of several classes of \(p\)-ary cyclic codes
- Weight polarization and divisibility
Factorials, binomial coefficients, combinatorial functions (05A10) Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Sequences (mod (m)) (11B50)
Cites Work
- Title not available (Why is that?)
- A divisibility property for Stirling numbers
- A 2-adic approach to the analysis of cyclic codes
- Zeroes of Polynomials Over Finite Fields
- On a Theorem of Ax
- A Chevalley-Warning Approach To p-Adic Estimates of Character Sums
- 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
Cited In (12)
- 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
- Divisibility on point counting over finite Witt rings
- Divisibility of exponential sums via elementary methods
- Ax's lemma and Ax's theorem in the Aichinger-Moosbauer calculus
- Functional degrees and arithmetic applications. I: The set of functional degrees
- Proof of the list edge coloring conjecture for complete graphs of prime degree
- An equivalence of Ward's bound and its application
- Zeros of polynomials over finite Witt rings
- A generalized Gleason-Pierce-Ward theorem
- Chevalley-Warning type results on abelian groups
- Classification of polynomial mappings between commutative groups.
This page was built for publication: A lemma on polynomials modulo \(p^m\) and applications to coding theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856866)
