Title :
Explicit codes with low covering radius
Author :
Pach, Janos ; Spencer, Joel
Author_Institution :
Math. Inst. of the Hungarian Acad. of Sci., Budapest, Hungary
fDate :
9/1/1988 12:00:00 AM
Abstract :
A series of explicit low-rate binary linear codes that have relatively low covering radius and can be rapidly decoded is exhibited. These codes can be derived from higher-dimensional analogs of the Gale-Berlekamp switching game. Conjectures of independent interest involving Hadamard matrices are given that could yield semiexplicit covering codes of very low density
Keywords :
codes; decoding; encoding; Gale-Berlekamp switching game; Hadamard matrices; binary linear codes; covering codes; covering radius; decoding; explicit codes; Data compression; Decoding; Error correction; Error correction codes; Hamming distance; Helium; Linear code; Mathematics; Switches; Vectors;
Journal_Title :
Information Theory, IEEE Transactions on
