Some new lower bounds for binary and ternary covering codes

From MaRDI portal

DOI10.1109/18.243462MaRDI QIDQ4307350zbMATH OpenOpenAlexFDO

Authors G. J. M. van Wee

Publication date 4 October 1994

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.243462


zbMATH Keywords

binary codescovering codescovering radiusfootball pool problemrook domains

Mathematics Subject Classification ID

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





Recommendations



Cited in
(26)








This page was built for publication: Some new lower bounds for binary and ternary covering codes

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Some_new_lower_bounds_for_binary_and_ternary_covering_codes&oldid=89378927"
Powered by MediaWiki