81 citations · 749 across the 99 of their papers we have counts for
7 papers · 2 filters
Coding for Optical Communications -- Can We Approach the Shannon Limit With Low Complexity?
Alexandre Graell i Amat, Gianluigi Liva, Fabian Steiner
Approaching capacity with low complexity is a very challenging task. In this paper, we review and compare three promising coding solutions to achieve that, which are suitable for f…
On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability
Alireza Sheikh, Alexandre Graell i Amat, Gianluigi Liva +1
We use density evolution to optimize the parameters of binary product codes (PCs) decoded based on the recently introduced iterative bounded distance decoding with scaled reliabili…
Symbol Message Passing Decoding of Nonbinary Low-Density Parity-Check Codes
Francisco Lázaro, Alexandre Graell i Amat, Gianluigi Liva +1
We present a novel decoding algorithm for q-ary low-density parity-check codes, termed symbol message passing. The proposed algorithm can be seen as a generalization of Gallager B…
Coded Distributed Tracking
Albin Severinson, Eirik Rosnes, Alexandre Graell i Amat
We consider the problem of tracking the state of a process that evolves over time in a distributed setting, with multiple observers each observing parts of the state, which is a fu…
One and Two Bit Message Passing for SC-LDPC Codes with Higher-Order Modulation
Fabian Steiner, Emna Ben Yacoub, Balazs Matuz +2
Low complexity decoding algorithms are necessary to meet data rate requirements in excess of 1 Tbps. In this paper, we study one and two bit message passing algorithms for belief p…
Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding
Alireza Sheikh, Alexandre Graell i Amat, Gianluigi Liva
We propose a binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the G…