#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1999

2017

- This year (0)
- Last 5 years (1)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Cyril Measson, Andrea Montanari, RÃ¼diger L. Urbanke
- IEEE Transactions on Information Theory
- 2008

There is a fundamental relationship between belief propagation and maximum a posteriori decoding. A decoding algorithm, which is called the Maxwell decoder, is introduced and provides a constructiveâ€¦ (More)

| We consider communication over memoryless channels using low-density parity-check code ensembles above the iterative (belief propagation) threshold. What is the computational complexity of decodingâ€¦ (More)

- Cyril Measson, Andrea Montanari, Thomas J. Richardson, RÃ¼diger L. Urbanke
- IEEE Transactions on Information Theory
- 2009

There is a fundamental relationship between belief propagation (BP) and maximum a posteriori decoding. The case of transmission over the binary erasure channel was investigated in detail in aâ€¦ (More)

- Cyril Measson, Annamaria Montanari, Rudiger. Urbanke
- International Symposium onInformation Theoryâ€¦
- 2004

Consider transmission over the binary erasure channel using LDPC codes. We observed in [C. Measson, et al. (2003)] a curious relationship between the resulting maximum-likelihood (ML) decoding curveâ€¦ (More)

- Joachim Hagenauer, Elke Offer, Cyril Measson, Matthias MÃ¶rz
- European Transactions on Telecommunications
- 1999

Using analog, non-linear and highly parallel networks, we a tt mpt to perform decoding of block and convolutional codes, equalization of certain frequency-s elective channels, decoding of multi-levelâ€¦ (More)

- Cyril Measson
- 2007

This work deals with coding systems based on sparse graphs. The key issue we address is the relationship between iterative (in particular belief propagation) and maximum a posteriori decoding. Weâ€¦ (More)

- Shrinivas Kudekar, Cyril Measson, Thomas J. Richardson, RÃ¼diger L. Urbanke
- 2010 6th International Symposium on Turbo Codesâ€¦
- 2010

We consider spatially coupled code ensembles. A particular instance are convolutional LDPC ensembles. It was recently shown that, for transmission over the binary erasure channel, this couplingâ€¦ (More)

- Cyril Measson, Andrea Montanari, RÃ¼diger L. Urbanke
- ArXiv
- 2005

We show that iterative coding systems can not surpass capacity using only quantities which naturally appear in density evolution. Although the result in itself is trivial, the method which we applyâ€¦ (More)

- Alberto Vigato, Lorenzo Vangelista, Cyril Measson, Xinzhou Wu
- IEEE Transactions on Communications
- 2011

Given a synchronous wireless network with N nodes uniformly located at random on a finite plane, we consider the problem of distributed peer discovery: all nodes want to discover as many other nodesâ€¦ (More)

- Cyril Measson, Andrea Montanari, RÃ¼diger L. Urbanke
- 2007 IEEE International Symposium on Informationâ€¦
- 2007

The rate of a code is one of its most important parameters. We consider sparse graph codes and ask whether the rate of a random element of an ensemble is typically close to the design rate of theâ€¦ (More)