Explicit codes with low covering radius

DOI10.1109/18.21258zbMath0665.94011OpenAlexW2048189784MaRDI QIDQ3818238

János Pach, J. H. 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

Hadamard matricesGale-Berlekamp switching gamelow-rate binary linear codes

Mathematics Subject Classification ID

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

Related Items (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