The covering radius of extreme binary 2-surjective codes

DOI10.1007/S10623-007-9150-XzbMath1178.94257OpenAlexW2138491489MaRDI QIDQ1008977

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-9150-x

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) 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
• 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
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A finite set covering theorem II

This page was built for publication: The covering radius of extreme binary 2-surjective codes