A remark on Haas' method

DOI10.1016/j.disc.2008.09.042zbMath1169.94018OpenAlexW2064613794MaRDI QIDQ1025956

Alain Plagne

Publication date: 23 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

lower boundcovering code

Mathematics Subject Classification ID

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

Related Items (2)

Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one ⋮ On the general excess bound for binary codes with covering radius one

Cites Work

• Unnamed Item
• Lower bounds for \(q\)-ary coverings by spheres of radius one
• New upper bounds for binary covering codes
• Binary and ternary codes of covering radius one: some new lower bounds
• On the size of optimal binary codes of length 9 and covering radius 1

This page was built for publication: A remark on Haas' method