Optimal \(p\)-ary cyclic codes with minimum distance four from monomials (Q301634)
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: Optimal \(p\)-ary cyclic codes with minimum distance four from monomials |
scientific article; zbMATH DE number 6600186
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal \(p\)-ary cyclic codes with minimum distance four from monomials |
scientific article; zbMATH DE number 6600186 |
Statements
Optimal \(p\)-ary cyclic codes with minimum distance four from monomials (English)
0 references
1 July 2016
0 references
cyclic code
0 references
perfect nonlinear function
0 references
almost perfect nonlinear function
0 references
finite field
0 references
0 references
0 references
0 references
0.9558902
0 references
0.90983886
0 references
0.90593815
0 references
0.9057682
0 references
0.9047427
0 references
0.8992848
0 references
0.8979105
0 references
0.89616823
0 references
0.8951428
0 references
