Explicit codes with low covering radius

Janos Pach, Joel Spencer

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)1281-1285
Number of pages5
JournalIEEE Transactions on Information Theory
Volume34
Issue number5 pt 2
DOIs
StatePublished - Sep 1988

Fingerprint

Hadamard matrices

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Explicit codes with low covering radius. / Pach, Janos; Spencer, Joel.

In: IEEE Transactions on Information Theory, Vol. 34, No. 5 pt 2, 09.1988, p. 1281-1285.

Research output: Contribution to journalArticle

Pach, Janos ; Spencer, Joel. / Explicit codes with low covering radius. In: IEEE Transactions on Information Theory. 1988 ; Vol. 34, No. 5 pt 2. pp. 1281-1285.
@article{9fe86e4a9c584289b6d967d78eafce45,
title = "Explicit codes with low covering radius",
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.",
author = "Janos Pach and Joel Spencer",
year = "1988",
month = "9",
doi = "10.1109/18.21258",
language = "English (US)",
volume = "34",
pages = "1281--1285",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5 pt 2",

}

TY - JOUR

T1 - Explicit codes with low covering radius

AU - Pach, Janos

AU - Spencer, Joel

PY - 1988/9

Y1 - 1988/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0024079555&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024079555&partnerID=8YFLogxK

U2 - 10.1109/18.21258

DO - 10.1109/18.21258

M3 - Article

AN - SCOPUS:0024079555

VL - 34

SP - 1281

EP - 1285

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 5 pt 2

ER -