On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length (Q2260787)
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: On the bounds and achievability about the ODPC of GRM(2,m)^* over prime fields for increasing message length |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length |
scientific article |
Statements
On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length (English)
0 references
12 March 2015
0 references
cyclic code
0 references
exponential sum
0 references
generalized Reed-Muller code
0 references
optimum distance profile
0 references
quadratic form
0 references
0 references
0 references
0 references
0 references
0.8174033
0 references
0.81682724
0 references
0.8144096
0 references
0.8087072
0 references
0.80814904
0 references
0.8062905
0 references
0.80340266
0 references
0.8012792
0 references
0.8012318
0 references
