On the general excess bound for binary codes with covering radius one

DOI10.1016/J.DISC.2013.07.024MaRDI QIDQ5891409zbMATH OpenOpenAlexFDO

Authors Wolfgang Haas

Publication date 24 January 2014

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2013.07.024

zbMATH Keywords

binary codescovering codescovering radiusgeneral excess boundlower bounds

Mathematics Subject Classification ID

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

Recommendations

• On the general excess bound for binary codes with covering radius one
• Binary codes with covering radius one: Some new lower bounds
• New lower bounds for binary covering codes
• Combinatorial lower bounds on binary codes with covering radius one
• Some new lower bounds for binary and ternary covering codes

Cites work

• A remark on Haas' method
• Binary and ternary codes of covering radius one: some new lower bounds
• Binary codes with covering radius one: Some new lower bounds
• Combinatorial lower bounds on binary codes with covering radius one
• Further results on the covering radius of codes
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 3417479 (Why is no real title available?)
• Improved sphere bounds on the covering radius of codes

Cited in

(2)

• Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space
• On the general excess bound for binary codes with covering radius one

This page was built for publication: On the general excess bound for binary codes with covering radius one

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