A series of explicit low-rate binary linear codes which have relatively low covering radius and can be rapidly decoded is exhibited. These codes can be derived from higher dimensional analogues of the Gale-Berlekamp switching game. Conjectures of independent interest involving Hadamard matrices are given, which would yield semi-explicit covering codes of very low density.
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences