Covering codes with improved density

DOI10.1109/TIT.2003.813490zbMath1247.94070OpenAlexW2107482120MaRDI QIDQ3547185

Michael Krivelevich, Van H. Vu, Benjamin 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)

Related Items (4)

Approximating Boolean Functions with Depth-2 Circuits ⋮ Covering codes for the fixed length Levenshtein metric ⋮ Density of constant radius normal binary covering codes ⋮ De Bruijn covering codes with arbitrary alphabets

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