Explicit codes with low covering radius

DOI10.1109/18.21258MaRDI QIDQ3818238zbMATH OpenOpenAlexFDO

Authors János Pach, Joel Spencer

Publication date 1989

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.21258

zbMATH Keywords

Gale-Berlekamp switching gameHadamard matriceslow-rate binary linear codes

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial games (91A46) Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• A new approach to the covering radius of codes
• scientific article; zbMATH DE number 3965968
• scientific article; zbMATH DE number 1284421
• Covering radius 1985-1994
• Linear codes with covering radius 2 and other new covering codes

Cited in

(2)

• The solution to Berlekamp's switching game
• A deterministic view of random sampling and its use in geometry

This page was built for publication: Explicit codes with low covering radius

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