356 citations · 1.4k across the 78 of their papers we have counts for
14 papers · 1 filter
Efficient Error-Correcting Codes in the Short Blocklength Regime
Mustafa Cemil Coşkun, Giuseppe Durisi, Thomas Jerkovits +4
The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem that is gaining relevance thanks to emerging applicat…
Energy-Efficient Soft-Assisted Product Decoders
Christoffer Fougstedt, Alireza Sheikh, Alexandre Graell i Amat +2
We implement a 1-Tb/s 0.63-pJ/bit soft-assisted product decoder in a 28-nm technology. The decoder uses one bit of soft information to improve its net coding gain by 0.2 dB, reachi…
Caching at the Edge with LT codes
Estefanía Recayte, Francisco Lázaro, Gianluigi Liva
We study the performance of caching schemes based on LT under peeling (iterative) decoding algorithm. We assume that users ask for downloading content to multiple cache-aided trans…
Protograph-Based LDPC Code Design for Ternary Message Passing Decoding
Emna Ben Yacoub, Fabian Steiner, Balazs Matuz +1
A ternary message passing (TMP) decoding algorithm for low-density parity-check codes is developed. All messages exchanged between variable and check nodes have a ternary alphabet,…
A Droplet Approach Based on Raptor Codes for Distributed Computing With Straggling Servers
Albin Severinson, Alexandre Graell i Amat, Eirik Rosnes +2
We propose a coded distributed computing scheme based on Raptor codes to address the straggler problem. In particular, we consider a scheme where each server computes intermediate…
Bit-Metric Decoding of Non-Binary LDPC Codes with Probabilistic Amplitude Shaping
Fabian Steiner, Georg Böcherer, Gianluigi Liva
A new approach for combining non-binary low-density parity-check (NB-LDPC) codes with higher-order modulation and probabilistic amplitude shaping (PAS) is presented. Instead of sym…
Bounds on the Error Probability of Raptor Codes under Maximum Likelihood Decoding
Francisco Lázaro, Gianluigi Liva, Gerhard Bauch +1
In this paper upper and lower bounds on the probability of decoding failure under maximum likelihood decoding are derived for different (nonbinary) Raptor code constructions. In pa…
Caching at the Edge with Fountain Codes
Estefania Recayte, Francisco Lázaro, Gianluigi Liva
We address the use of linear randon fountain codes caching schemes in a heterogeneous satellite network. We consider a system composed of multiple hubs and a geostationary Earth or…
On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems
Alireza Sheikh, Alexandre Graell i Amat, Gianluigi Liva +2
We study low-complexity iterative decoding algorithms for product codes. We revisit two algorithms recently proposed by the authors based on bounded distance decoding (BDD) of the…
Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability
Alireza Sheikh, Alexandre Graell i Amat, Gianluigi Liva
We propose a modified iterative bounded distance decoding of product codes. The proposed algorithm is based on exchanging hard messages iteratively and exploiting channel reliabili…
Finite Length Analysis of Irregular Repetition Slotted ALOHA in the Waterfall Region
Alexandre Graell i Amat, Gianluigi Liva
A finite length analysis is introduced for irregular repetition slotted ALOHA (IRSA) that enables to accurately estimate its performance in the moderate-to-high packet loss probabi…
Improving the Decoding Threshold of Tailbiting Spatially Coupled LDPC Codes by Energy Shaping
Thomas Jerkovits, Gianluigi Liva, Alexandre Graell i Amat
We show how the iterative decoding threshold of tailbiting spatially coupled (SC) low-density parity-check (LDPC) code ensembles can be improved over the binary input additive whit…
Protograph-based Quasi-Cyclic MDPC Codes for McEliece Cryptosystems
Gianluigi Liva, Hannes Bartz
In this paper, ensembles of quasi-cyclic moderate-density parity-check (MDPC) codes based on protographs are introduced and analyzed in the context of a McEliece-like cryptosystem.…
On Decoding Schemes for the MDPC-McEliece Cryptosystem
Hannes Bartz, Gianluigi Liva
Recently, it has been shown how McEliece public-key cryptosystems based on moderate-density parity-check (MDPC) codes allow for very compact keys compared to variants based on othe…