On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length (Q2260787): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091877955 / rank | |||
Normal rank | |||
Revision as of 18:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
