A lemma on polynomials modulo \(p^m\) and applications to coding theory (Q856866)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lemma on polynomials modulo p^m and applications to coding theory |
scientific article; zbMATH DE number 5080061
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lemma on polynomials modulo \(p^m\) and applications to coding theory |
scientific article; zbMATH DE number 5080061 |
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
0.7363179326057434
0 references
0.7285701036453247
0 references
0.7168870568275452
0 references
0.7166327238082886
0 references
0.7146726250648499
0 references
