Bounds on rates of LDPC codes for BEC with varying erasure rate

Ohad Barak*, Uri Erez, David Burshtein

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

A binary erasure channel with erasure probability which can take one of two values is considered. Transmission is done by using a low density parity-check code under the requirement that completely successful decoding is possible when the channel is in its better state, while tolerating some predetermined residual erasure fraction when the channel is in its worse state. Upper bounds on the achievable design rate under iterative decoding are derived for this setting. These bounds are compared to rates obtained by practical code profiles. It is also observed that when exceeding the capacity of the erasure channel, the performance of such codes exhibits graceful degradation as measured by the residual erasure fraction.

Original languageEnglish
Article number5590327
Pages (from-to)2835-2844
Number of pages10
JournalIEEE Transactions on Communications
Volume58
Issue number10
DOIs
StatePublished - Oct 2010

Keywords

  • Low density parity check (LDPC) codes
  • binary erasure channel (BEC)
  • iterative decoding
  • residual erasure fraction

Fingerprint

Dive into the research topics of 'Bounds on rates of LDPC codes for BEC with varying erasure rate'. Together they form a unique fingerprint.

Cite this