138 citations · 290 across the 8 of their papers we have counts for
8 papers · 1 filter
Exploring and Experimenting with Shaping Designs for Next-Generation Optical Communications
Fanny Jardel, Tobias A. Eriksson, Cyril Méasson +4
A class of circular 64-QAM that combines 'geometric' and 'probabilistic' shaping aspects is presented. It is compared to square 64-QAM in back-to-back, single-channel, and WDM tran…
Probabilistic Shaping and Non-Binary Codes
Joseph J. Boutros, Fanny Jardel, Cyril Méasson
We generalize probabilistic amplitude shaping (PAS) with binary codes to the case of non-binary codes defined over prime finite fields. Firstly, we introduce probabilistic shaping…
Threshold Saturation on BMS Channels via Spatial Coupling
Shrinivas Kudekar, Cyril Measson, Tom Richardson +1
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,…
TP Decoding
Yi Lu, Cyril Measson, Andrea Montanari
`Tree pruning' (TP) is an algorithm for probabilistic inference on binary Markov random fields. It has been recently derived by Dror Weitz and used to construct the first fully pol…
The Generalized Area Theorem and Some of its Consequences
Cyril Measson, Andrea Montanari, Tom Richardson +1
There is a fundamental relationship between belief propagation and maximum a posteriori decoding. The case of transmission over the binary erasure channel was investigated in detai…
Why We Can Not Surpass Capacity: The Matching Condition
Cyril Measson, Andrea Montanari, Rudiger Urbanke
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 meth…