The covering radius of extreme binary 2-surjective codes

DOI10.1007/S10623-007-9150-XMaRDI QIDQ1008977zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the covering radius of binary codes (Corresp.)
• scientific article; zbMATH DE number 1522570
• Publication:4886131
• On the covering radius of codes
• On covering radius lower bound for a class of binary codes
• On covering radius of codes over \(\mathbb{Z}_{2p}\)
• On the covering radius of some binary cyclic codes
• scientific article; zbMATH DE number 721640
• Asymptotic bounds on the covering radius of binary codes
• On the general excess bound for binary codes with covering radius one

Cites work

• scientific article; zbMATH DE number 3935081 (Why is no real title available?)
• A finite set covering theorem II
• Families of \(k\)-independent sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Sperner systems consisting of pairs of complementary subsets
• Two applications (for search theory and truth functions) of Sperner type theorems

Cited in

(2)

• On generalized surjective codes
• A coding theoretic application of Zsolt Baranyai's factorization theorem

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

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