On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)

DOI10.1007/s10623-007-9156-4zbMath1178.94258OpenAlexW2004730115MaRDI QIDQ1009034

Patric R. J. Östergård, Gerzson Kéri

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-007-9156-4

Mathematics Subject Classification ID

Bounds on codes (94B65) Combinatorial codes (94B25) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification algorithms for codes and designs
• Further results on the covering radius of small codes
• Sperner systems consisting of pairs of complementary subsets
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• Further results on the covering radius of codes
• Classification of binary covering codes
• An updated table of binary/ternary mixed covering codes
• A finite set covering theorem II
• New lower bounds for covering codes
• Covering problems for dichotomized matchings

This page was built for publication: On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)