On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius

DOI10.1137/0608049MaRDI QIDQ3786402zbMATH OpenOpenAlexFDO

Authors Karen E. Kilby, N. J. A. Sloane

Publication date 1987

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0608049

zbMATH Keywords

binary codesnormal codeabnormal nonlinear codesnormalized covering radiusstable code

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Theory of error-correcting codes and error-detecting codes (94B99)

Cites work

• scientific article; zbMATH DE number 3878836 (Why is no real title available?)
• scientific article; zbMATH DE number 3965968 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• A new approach to the covering radius of codes
• Computing automorphism groups of error-correcting codes
• Covering radius---Survey and recent results
• Further results on the covering radius of codes
• Minimum-distance bounds for binary linear codes
• On the covering radius of codes

Cited in

(5)

• Bounds for binary multiple covering codes
• Covering bounds for codes
• On the normality of multiple covering codes
• On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
• The solution to Berlekamp's switching game

This page was built for publication: On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius

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