Covering radius of the Reed-Muller code \(R(1,7)\) -- a simpler proof (Q1914016): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q165902 |
||
| Property / author | |||
| Property / author: Xiang-Dong Hou / rank | |||
Revision as of 00:08, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Covering radius of the Reed-Muller code \(R(1,7)\) -- a simpler proof |
scientific article |
Statements
Covering radius of the Reed-Muller code \(R(1,7)\) -- a simpler proof (English)
0 references
9 July 1996
0 references
\textit{J. J. Mykkeltveit} [IEEE Trans. Inf. Theory 26, 359-362 (1980; Zbl 0431.94036)] proved that the covering radius of the Reed-Muller code \(R(1,7)\) equals 56. Mykkeltveit showed this by establishing the nonexistence of a \([57, 8, 25]\) self-complementary code of strength 2. In this paper the author gives a simpler proof which avoids this approach entirely.
0 references
covering radius
0 references
Reed-Muller code \(R(1,7)\)
0 references
