Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On lower bounds for covering codes

From MaRDI portal
Publication:1281409
Jump to:navigation, search

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


zbMATH Keywords

covering radiuslower boundsHamming spacebinary codeHamming spheresbinary covering codeminimum number of codewordssphere bound


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)








This page was built for publication: On lower bounds for covering codes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1281409&oldid=13381879"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 10:07.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki