On the weight spectrum of good linear binary codes

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


The weight spectrum of sequences of binary linear codes that achieve arbitrarily small word error probability on a class of noisy channels at a nonzero rate is studied. We refer to such sequences as good codes. The class of good codes includes turbo, low-density parity-check, and repeat-accumulate codes. We show that a sequence of codes is good when transmitted over a memoryless binary-synunetric channel (BSC) or an additive white Gaussian noise (AWGN) channel if and only if the slope of its spectrum is finite everywhere and its minimum Hamming distance goes to infinity with no requirement on its rate growth. The extension of these results to code ensembles in probabilistic terms follows in a direct manner. We also show that the sufficient condition holds for any binary-input memoryless channel.

Original languageEnglish (US)
Pages (from-to)4369-4373
Number of pages5
JournalIEEE Transactions on Information Theory
Issue number12
StatePublished - Dec 2005

All Science Journal Classification (ASJC) codes

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


  • Binary linear code
  • Good codes
  • Low-density parity-check codes
  • Maximum-likelihood (ML) decoding
  • Turbo codes
  • Weight spectrum


Dive into the research topics of 'On the weight spectrum of good linear binary codes'. Together they form a unique fingerprint.

Cite this