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

DOI10.1137/0608049zbMATH Open0643.94020OpenAlexW2003664743MaRDI QIDQ3786402FDOQ3786402

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

• Title not available (Why is that?)
• Further results on the covering radius of codes
• Covering radius---Survey and recent results
• On the covering radius of codes
• Title not available (Why is that?)
• A new approach to the covering radius of codes
• Computing automorphism groups of error-correcting codes
• Minimum-distance bounds for binary linear codes
• Title not available (Why is that?)

Cited In (5)

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

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)