Binary and ternary codes of covering radius one: some new lower bounds

DOI10.1016/S0012-365X(00)00461-1zbMath1013.94039OpenAlexW1984639056MaRDI QIDQ1849922

Wolfgang Haas

Publication date: 2 December 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00461-1

zbMATH Keywords

binary codeslower boundsternary codesfootball pool problemcovering radius onelienar inequalities

Mathematics Subject Classification ID

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

Related Items (2)

On the general excess bound for binary codes with covering radius one ⋮ A remark on Haas' method

This page was built for publication: Binary and ternary codes of covering radius one: some new lower bounds