Optimal binary covering codes of length 2j

DOI10.1002/JCD.20081MaRDI QIDQ3376666zbMATH OpenOpenAlexFDO

Authors William D. Weakley

Publication date 24 March 2006

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jcd.20081

zbMATH Keywords

covering codedominating setsingle-error-correcting code

Mathematics Subject Classification ID

Bounds on codes (94B65)

Recommendations

• On the covering radius of binary codes (Corresp.)
• Optimal binary vector quantization via enumeration of covering codes
• scientific article; zbMATH DE number 1522570
• Lower bounds for binary covering codes
• Asymptotic bounds on the covering radius of binary codes
• Exact bounds on the sizes of covering codes
• New upper bounds for binary covering codes
• On covering radius lower bound for a class of binary codes
• New lower bounds for binary covering codes
• scientific article; zbMATH DE number 177895

Cited in

(4)

• Switching of covering codes
• Classification of binary covering codes
• On asymmetric coverings and covering numbers
• (Total) domination in prisms

This page was built for publication: Optimal binary covering codes of length 2j

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