On lower bounds for covering codes
From MaRDI portal
Publication:1281409
DOI10.1023/A:1008364924033zbMath0968.94020OpenAlexW1558302636MaRDI QIDQ1281409
M. C. Bhandari, K. K. P. Chanduka, Arbind Kumar Lal
Publication date: 18 September 2001
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008364924033
covering radiuslower boundsHamming spacebinary codeHamming spheresbinary covering codeminimum number of codewordssphere bound
Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
This page was built for publication: On lower bounds for covering codes