Explicit Codes with Low Covering Radius

Janos Pach; Joel Spencer

doi:10.1109/18.21258

Explicit Codes with Low Covering Radius

Janos Pach, Joel Spencer

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English (US)
Pages (from-to)	1281-1285
Number of pages	5
Journal	IEEE Transactions on Information Theory
Volume	34
Issue number	5
DOIs	https://doi.org/10.1109/18.21258
State	Published - Sep 1988

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/18.21258

Cite this

@article{9fe86e4a9c584289b6d967d78eafce45,

title = "Explicit Codes with Low Covering Radius",

abstract = "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.",

author = "Janos Pach and Joel Spencer",

year = "1988",

month = sep,

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",

}

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

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

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

SN - 0018-9448

VL - 34

SP - 1281

EP - 1285

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 5

ER -

Explicit Codes with Low Covering Radius

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this