Covering codes with improved density

DOI10.1109/TIT.2003.813490MaRDI QIDQ3547185zbMATH OpenOpenAlexFDO

Authors Michael Krivelevich, Van Vu, Benny Sudakov

Publication date 21 December 2008

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

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

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)

Recommendations

• Further results on the covering radius of codes
• New lower bounds for covering codes
• Asymptotic bounds on the covering radius of binary codes
• Asymmetric binary covering codes.
• Covering radius 1985-1994

Cited in

(7)

• Covering codes for the fixed length Levenshtein metric
• Constructions of Turán systems that are tight up to a multiplicative constant
• De Bruijn covering codes with arbitrary alphabets
• Constructions of covering sequences and 2D-sequences
• On isomorphism-invariant antistochastic properties of random graphs
• Density of constant radius normal binary covering codes
• Approximating Boolean functions with depth-2 circuits

This page was built for publication: Covering codes with improved density

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