356 citations · 1.4k across the 78 of their papers we have counts for
14 papers · 1 filter
Ternary Quantized Polar Code Decoders: Analysis and Design
Joachim Neu, Mustafa Cemil Coşkun, Gianluigi Liva
The performance of short polar codes under successive cancellation (SC) and SC list (SCL) decoding is analyzed for the case where the decoder messages are coarsely quantized. This…
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…
Parallel Concatenation of Non-Binary Linear Random Fountain Codes with Maximum Distance Separable Codes
Francisco Lázaro, Giuliano Garrammone, Gianluigi Liva
The performance and the decoding complexity of a novel coding scheme based on the concatenation of maximum distance separable (MDS) codes and linear random fountain codes are inves…
Successive Cancellation List Decoding of Product Codes with Reed-Muller Component Codes
Mustafa Cemil Coşkun, Thomas Jerkovits, Gianluigi Liva
This letter proposes successive cancellation list (SCL) decoding of product codes with Reed--Muller (RM) component codes. SCL decoding relies on a product code description based on…
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…
Short Non-Binary Low-Density Parity-Check Codes for Phase Noise Channels
Tudor Ninacs, Balázs Matuz, Gianluigi Liva +1
This work considers the design of short non-binary low-density parity-check (LDPC) codes over finite fields of order m, for channels with phase noise. In particular, m-ary differen…
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…
Multiple-Relay Slotted ALOHA: Performance Analysis and Bounds
Andrea Munari, Federico Clazzer, Gianluigi Liva +1
Wireless random access protocols are attracting a revived research interest as a simple yet effective solution for machine-type communications. In the quest to improve reliability…
From 5G to 6G: Has the Time for Modern Random Access Come?
Federico Clazzer, Andrea Munari, Gianluigi Liva +3
This short paper proposes the use of modern random access for IoT applications in 6G. A short overview of recent advances in uncoordinated medium access is provided, highlighting t…
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-like Codes
Alireza Sheikh, Alexandre Graell i Amat, Gianluigi Liva
We propose a novel binary message passing decoding algorithm for product-like codes based on bounded distance decoding (BDD) of the component codes. The algorithm, dubbed iterative…
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…
A Lower Bound on the Error Exponent of Linear Block Codes over the Erasure Channel
Enrico Paolini, Gianluigi Liva
A lower bound on the maximum likelihood (ML) decoding error exponent of linear block code ensembles, on the erasure channel, is developed. The lower bound turns to be positive, ove…
Low-Complexity Joint Channel Estimation and List Decoding of Short Codes
Mustafa Cemil Coşkun, Gianluigi Liva, Johan Östman +1
A pilot-assisted transmission (PAT) scheme is proposed for short blocklengths, where the pilots are used only to derive an initial channel estimate for the list construction step.…