Covering radius of the Reed-Muller code \(R(1,7)\) -- a simpler proof (Q1914016): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcta.1996.0055 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996191578 / rank | |||
Normal rank | |||
Latest revision as of 02:13, 20 March 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
