Extremal self-dual \([40,20,8]\) codes with covering radius 7 (Q1827585)
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 2083584
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extremal self-dual \([40,20,8]\) codes with covering radius 7 |
scientific article; zbMATH DE number 2083584 |
Statements
Extremal self-dual \([40,20,8]\) codes with covering radius 7 (English)
0 references
6 August 2004
0 references
\textit{E. Assmus} and \textit{V. Pless} [IEEE Trans. Inf. Theory 29, 359--363 (1983; Zbl 0504.94028)] showed that the minimum possible covering radius of an extremal doubly-even binary \([40,20,8]\) code is 6, 7, or 8; \textit{M. Harada} and \textit{M. Ozeki} [Discrete Math. 215, 271--281 (2000; Zbl 0974.94027)] found such a code with covering radius 7. Nonexistence of codes with covering radius 6 has been mentioned in the literature, but these results were withdrawn by \textit{M. Ozeki} [IEEE Trans. Inf. Theory 48, 547--556 (2002; Zbl 1064.94020 In the current paper an extremal doubly-even binary \([40,20,8]\) code with covering radius 7 is presented which is not equivalent to the code presented by Harada and Ozeki (loc. cit.). Singly-even codes with these parameters are also discussed, as well as some related 1-designs.
0 references
covering radius
0 references
extremal code
0 references
harmonic weight enumerator
0 references
self-dual code
0 references
0 references
0.9041510820388794
0 references
0.9041510820388794
0 references
0.8902650475502014
0 references
0.8863000869750977
0 references
0.8649497032165527
0 references
