The covering radius of extreme binary 2-surjective codes

DOI10.1007/S10623-007-9150-XzbMATH Open1178.94257OpenAlexW2138491489MaRDI QIDQ1008977FDOQ1008977

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

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

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

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• Sperner systems consisting of pairs of complementary subsets
• A finite set covering theorem II
• Title not available (Why is that?)

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)