The Covering Radius of the Reed–Muller Code <i>RM</i>(<i>m</i> – 4, <i>m</i>) in <i>RM</i>(<i>m</i> – 3, <i>m</i>) (Q5030307)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7475647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Covering Radius of the Reed–Muller Code <i>RM</i>(<i>m</i> – 4, <i>m</i>) in <i>RM</i>(<i>m</i> – 3, <i>m</i>) |
scientific article; zbMATH DE number 7475647 |
Statements
The Covering Radius of the Reed–Muller Code <i>RM</i>(<i>m</i> – 4, <i>m</i>) in <i>RM</i>(<i>m</i> – 3, <i>m</i>) (English)
0 references
17 February 2022
0 references
covering radius
0 references
Reed-Muller code
0 references
distance from Boolean polynomial
0 references
0.93410385
0 references
0.9320886
0 references
0.9310503
0 references
0.9250137
0 references
0.92465836
0 references
0.92350113
0 references
0 references
0.9165986
0 references
0 references
