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 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 languageEnglish (US)
Pages (from-to)1281-1285
Number of pages5
JournalIEEE Transactions on Information Theory
Volume34
Issue number5
DOIs
StatePublished - Sep 1988

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'Explicit Codes with Low Covering Radius'. Together they form a unique fingerprint.

  • Cite this