Extremal self-dual codes with the smallest covering radius

DOI10.1016/S0012-365X(99)00318-0zbMath0974.94027OpenAlexW2172220530MaRDI QIDQ1974541

Masaaki Harada, Michio Ozeki

Publication date: 19 November 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00318-0

zbMATH Keywords

covering radiusself-dual codeextremal code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (2)

Designs and self-dual codes with long shadows. ⋮ Extremal self-dual \([40,20,8\) codes with covering radius 7]

This page was built for publication: Extremal self-dual codes with the smallest covering radius