The rate of regular LDPC codes

  • Authors:

  • G. Miller;G. Cohen

  • Affiliations:

  • Ecole Nat. Superieure des Telecommun., Paris, France;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.90

Visualization

Abstract

We find the rate of a typical code from the regular low-density parity-check (LDPC) ensemble. We then show that the rate of a code from the ensemble converges to the design rate in quadratic mean and almost surely.