#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2006

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jeremie Ezri, Andrea Montanari, Rüdiger L. Urbanke
- 2007 IEEE International Symposium on Information…
- 2007

We want to extend the approximation of the error probability via a scaling approach from the BEC to general binary-input memoryless output-symmetric (BMS) channels. In particular, we consider such scaling laws for regular LDPC ensembles and message-passing (MP) decoders with a finite number of messages. We first show how to re-derive the scaling law for… (More)

- Jeremie Ezri, Michael Gastpar
- 2006 IEEE International Symposium on Information…
- 2006

A decode-and-forward LDPC-based coding and decoding scheme is proposed and applied to the BAWGN single-relay channel. The source broadcasts information to both the relay and the destination. The relay is able to simultaneously receive and transmit. Both the relay and the destination apply successive iterative decoding using belief propagation. In the… (More)

- Jeremie Ezri, Andrea Montanari, Sewoong Oh, Rüdiger L. Urbanke
- 2008 IEEE International Symposium on Information…
- 2008

Scaling laws are a powerful way to analyze the performance of moderately sized iteratively decoded sparse graph codes. Our aim is to provide an easily usable finite-length optimization tool that is applicable to the wide variety of channels, blocklengths, error probability requirements, and decoders that one encounters for practical systems. The tool is… (More)

- Jeremie Ezri, Rüdiger L. Urbanke, Andrea Montanari, Sewoong Oh
- 2008 IEEE International Symposium on Information…
- 2008

The dasiathresholdpsila of a code ensemble can be defined as the noise level at which the block error probability curve crosses 1/2. For ensembles of low-density parity check codes used over the binary erasure channel, the behavior of the threshold for large blocklengths is known in detail. It is characterized by an asymptotic threshold value, and a… (More)

We consider LDPC codes, transmission over the binary symmetric channel (BSC), and decoding using Gallager’s algorithm A. For those ensembles whose threshold is determined by the behavior of the algorithm at the beginning of the decoding process we derive a scaling law. This scaling law has the same form as the scaling law which was established for the the… (More)

- ‹
- 1
- ›