The covering radius of extremal self-dual code D11 and its application

DOI10.1109/18.567727MaRDI QIDQ4336315zbMATH OpenOpenAlexFDO

Authors Han-Ping Tsai

Publication date 6 October 1997

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.567727

zbMATH Keywords

weight enumeratorself-dual codescovering radius

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)

Recommendations

• Extremal self-dual codes with the smallest covering radius
• Extremal self-dual \([40,20,8]\) codes with covering radius 7
• On the covering radii of extremal doubly even self-dual codes

Cited in

(3)

• On the covering radii of extremal doubly even self-dual codes
• Extremal self-dual \([40,20,8]\) codes with covering radius 7
• On \(s\)-extremal singly even self-dual \([24k+8,12k+4,4k+2]\) codes

This page was built for publication: The covering radius of extremal self-dual code D11 and its application

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336315)