A lemma on polynomials modulo \(p^m\) and applications to coding theory (Q856866): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Zeroes of Polynomials Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-adic approach to the analysis of cyclic codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zeros of Functions in Finite Abelian Group Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Theorem of Ax / rank
 
Normal rank
Property / cites work
 
Property / cites work: A divisibility property for Stirling numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weight congruence for p-ary cyclic codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions on the weight distribution of binary linear codes imposed by the structure of Reed-Muller codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Chevalley-Warning Approach To p-Adic Estimates of Character Sums / rank
 
Normal rank

Revision as of 10:36, 25 June 2024

scientific article
Language Label Description Also known as
English
A lemma on polynomials modulo \(p^m\) and applications to coding theory
scientific article

    Statements

    A lemma on polynomials modulo \(p^m\) and applications to coding theory (English)
    0 references
    0 references
    14 December 2006
    0 references
    polynomials
    0 references
    codes
    0 references
    coding theory
    0 references
    weights
    0 references
    McEliece theorem
    0 references
    Ax-Katz theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references