Dc-Constrained Codes From Hadamard Matrices

Alexander M. Barg, Simon N. Litsyn

Research output: Contribution to journalArticlepeer-review

Abstract

The construction of balanced error-correcting codes with distance close to half of the block length and bounded running digital sum is considered. Use of these codes in cascade constructions allows us to obtain a number of classes of dc-constrained codes of various lengths. We also present a construction based on simple properties of quadratic residues, generalizing the Paley construction of Hadamard matrices.

Original languageEnglish
Pages (from-to)801-807
Number of pages7
JournalIEEE Transactions on Information Theory
Volume37
Issue number3
DOIs
StatePublished - May 1991
Externally publishedYes

Keywords

  • Legendre symbol
  • Running digital sum
  • incomplete exponential sum

Fingerprint

Dive into the research topics of 'Dc-Constrained Codes From Hadamard Matrices'. Together they form a unique fingerprint.

Cite this