A lemma on polynomials modulo \(p^m\) and applications to coding theory (Q856866): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2004.10.030 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2004.10.030 / rank | |||
Normal rank | |||
Latest revision as of 05:42, 10 December 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
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
0 references
