Chase-Pyndiah decoding is widely used for decoding product codes. Howeve...
The trade-off between reliability, latency, and energy-efficiency is a
c...
A class of rate-adaptive protograph MacKay-Neal (MN) codes is introduced...
We study a system in which two-state Markov sources send status updates ...
We study the dynamic behavior of frameless ALOHA, both in terms of throu...
We present a finite blocklength performance bound for a DNA storage chan...
The present paper focuses on an IoT setting in which a large number of
d...
We provide a characterization of the peak age of information (AoI) achie...
The problem of scalar multiplication applied to vectors is considered in...
We study the performance of low-density parity-check (LDPC) codes over f...
This letter analyzes a class of information freshness metrics for large ...
We present our vision for a departure from the established way of
archit...
We explore the problem of deriving a posteriori probabilities of being
d...
In this paper we investigate the performance of caching schemes based on...
A product code with single parity-check component codes can be seen as a...
We propose a novel soft-aided iterative decoding algorithm for product c...
The society as a whole, and many vertical sectors in particular, is beco...
A new protograph-based framework for message passing (MP) decoding of lo...
The performance of short polar codes under successive cancellation (SC) ...
Approaching capacity with low complexity is a very challenging task. In ...
The performance and the decoding complexity of a novel coding scheme bas...
This letter proposes successive cancellation list (SCL) decoding of prod...
We use density evolution to optimize the parameters of binary product co...
This work considers the design of short non-binary low-density parity-ch...
We present a novel decoding algorithm for q-ary low-density parity-check...
Wireless random access protocols are attracting a revived research inter...
High throughput and low complexity decoding algorithms are necessary in
...
We propose a novel binary message passing decoding algorithm for product...
A lower bound on the maximum likelihood (ML) decoding error exponent of
...
A pilot-assisted transmission (PAT) scheme is proposed for short
blockle...
We propose a binary message passing decoding algorithm for product codes...
The design of block codes for short information blocks (e.g., a thousand...
We implement a 1-Tb/s 0.63-pJ/bit soft-assisted product decoder in a 28-...
We study the performance of caching schemes based on LT under peeling
(i...
We propose a coded distributed computing scheme based on Raptor codes to...
In this paper, we develop a ternary message passing (TMP) decoding algor...
A new approach for combining non-binary low-density parity-check (NB-LDP...
In this paper upper bounds on the probability of decoding failure under
...
We address the use of linear randon fountain codes caching schemes in a
...
We study low-complexity iterative decoding algorithms for product codes....
We propose a modified iterative bounded distance decoding of product cod...
A finite length analysis is introduced for irregular repetition slotted ...
We show how the iterative decoding threshold of tailbiting spatially cou...
In this paper, ensembles of quasi-cyclic moderate-density parity-check (...
Recently, it has been shown how McEliece public-key cryptosystems based ...
We present nonasymptotic upper and lower bounds on the maximum coding ra...