Asymmetric binary covering codes.

DOI10.1006/jcta.2002.3290zbMath1033.94023arXivmath/0309081OpenAlexW2001316732MaRDI QIDQ1865393

Andrew B. Kahng, Robert B. Ellis, Joshua N. Cooper

Publication date: 26 March 2003

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0309081

zbMATH Keywords

boundsprobabilistic methodbinary codecovering codeminimal code

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

On a combinatorial problem for the set of binary vectors ⋮ Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts ⋮ Covering codes for the fixed length Levenshtein metric ⋮ Density of constant radius normal binary covering codes ⋮ Computing marginals using MapReduce ⋮ On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial techniques and objects in computer science: Fault-tolerance and other interesting applications
• On the covering radius of codes
• Covering radius---Survey and recent results
• Theory and design of t-unidirectional error-correcting and d-unidirectional error-detecting code
• On asymmetric coverings and covering numbers