A lemma on polynomials modulo \(p^m\) and applications to coding theory
type: Item
instance of: scholarly article
title: A lemma on polynomials modulo \(p^m\) and applications to coding theory
zbMATH Open document ID: 1156.11009
author: Richard M. Wilson
published in: Discrete Mathematics
publication date: 2006-12-14T00:00:00Z
Mathematics Subject Classification ID: 11B50
Mathematics Subject Classification ID: 05A10
Mathematics Subject Classification ID: 11T06
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 5080061
zbMATH Keywords: polynomials
zbMATH Keywords: codes
zbMATH Keywords: coding theory
zbMATH Keywords: weights
zbMATH Keywords: McEliece theorem
zbMATH Keywords: Ax-Katz theorem
MaRDI profile type: Publication
Wikidata QID: Q124844373
full work available at URL: j.disc.2004.10.030
OpenAlex ID: W2067365716
cites work: Zeroes of Polynomials Over Finite Fields
cites work: A 2-adic approach to the analysis of cyclic codes
cites work: Zeros of Functions in Finite Abelian Group Algebras
cites work: On a Theorem of Ax
cites work: A divisibility property for Stirling numbers
cites work: Q4146667
cites work: Weight congruence for p-ary cyclic codes
cites work: Restrictions on the weight distribution of binary linear codes imposed by the structure of Reed-Muller codes
cites work: A Chevalley-Warning Approach To p-Adic Estimates of Character Sums
DOI: 10.1016/J.DISC.2004.10.030
description: scientific article; zbMATH DE number 5080061