Extremal self-dual [40,20,8] codes with covering radius 7
\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.
- Extremal self-dual codes with the smallest covering radius
- The covering radius of extremal self-dual code D11 and its application
- On the covering radii of extremal doubly even self-dual codes
- Extremal self-dual codes of length 64 through neighbors and covering radii
- On \(s\)-extremal singly even self-dual \([24k+8,12k+4,4k+2]\) codes
- A new upper bound on the minimal distance of self-dual codes
- An upper bound for self-dual codes
- Classification of extremal double-circulant self-dual codes of length up to \(62\)
- Covering radius---Survey and recent results
- Extremal self-dual codes with the smallest covering radius
- Four fundamental parameters of a code and their combinatorial significance
- Hahn Polynomials, Discrete Harmonics, andt-Designs
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Jacobi polynomials for singly even self-dual codes and the covering radius problems
- On covering radii and coset weight distributions of extremal binary self-dual codes of length 40
- On harmonic weight enumerators of binary codes
- On the classification of self-dual \(\mathbb Z_k\)-codes
- On the coveting radius of extremal self-dual codes
- Shadow bounds for self-dual codes
- The mass of extremal doubly-even self-dual codes of length 40
- Uniqueness of some linear subcodes of the extended binary Golay code
- Extremal self-dual codes with the smallest covering radius
- On covering radii and coset weight distributions of extremal binary self-dual codes of length 40
- New extremal binary self-dual codes of length 64 from \(R_3\)-lifts of the extended binary Hamming code
- Extremal self-dual codes of length 64 through neighbors and covering radii
- On \(s\)-extremal singly even self-dual \([24k+8,12k+4,4k+2]\) codes
- On covering radii and coset weight distributions of extremal binary self-dual codes of length 56
- The weight distribution of the self-dual \([128,64]\) polarity design code
- On octonary codes and their covering radii
- On the Complete Coset Weight Distribution of the Extremal Self-Dual<tex>$[46, 23, 10]$</tex>Code
- The covering radius of extremal self-dual code D11 and its application
- On the covering radius of Z/sub 4/-codes and their lattices
- Jacobi polynomials for singly even self-dual codes and the covering radius problems
- On the covering radius problem for ternary self-dual codes
- On the covering radius of ternary extremal self-dual codes
This page was built for publication: Extremal self-dual \([40,20,8]\) codes with covering radius 7
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827585)
