Chase-Pyndiah decoding is widely used for decoding product codes. Howeve...
We propose FedGT, a novel framework for identifying malicious clients in...
We propose an irregular repetition slotted ALOHA (IRSA) based random-acc...
We investigate the coexistence of massive and critical Internet of Thing...
Most of today's communication systems are designed to target reliable me...
We consider error-correcting coding for DNA-based storage. We model the ...
We present a finite blocklength performance bound for a DNA storage chan...
The errors occurring in DNA-based storage are correlated in nature, whic...
CC-GLPDC codes are a class of generalized low-density parity-check (GLDP...
We propose four finite-length scaling laws to predict the frame error ra...
We propose a privacy-preserving federated learning (FL) scheme that is
r...
With the rapid expansion of the Internet of Things, the efficient sharin...
To account for the massive uncoordinated random access scenario, which i...
A new class of spatially-coupled turbo-like codes (SC-TCs), dubbed
gener...
We present two novel coded federated learning (FL) schemes for linear
re...
Age of information (AoI) is a performance metric that captures the fresh...
Decoding sequences that stem from multiple transmissions of a codeword o...
We consider straggler-resilient learning. In many previous works, e.g., ...
We consider a mobile edge computing scenario where a number of devices w...
We present a novel coded federated learning (FL) scheme for linear regre...
We consider a mobile edge computing scenario where users want to perform...
We introduce generalized spatially coupled parallel concatenated codes
(...
In streaming applications, doping improves the performance of
spatially-...
We present a novel autoencoder-based approach for designing codes that
p...
We consider distributed caching of content across several small base sta...
We extend the seminal work by Polyanskiy (2017) on massive uncoordinated...
We consider a wireless federated learning system where multiple data hol...
In this paper, we study a class of spatially coupled turbo codes, namely...
We consider near maximum-likelihood (ML) decoding of short linear block
...
We introduce a two-stage decimation process to improve the performance o...
Decoding sequences that stem from multiple transmissions of a codeword o...
A product code with single parity-check component codes can be seen as a...
Product codes (PCs) and staircase codes (SCCs) are conventionally decode...
Private information retrieval (PIR) protocols ensure that a user can dow...
We propose a novel soft-aided iterative decoding algorithm for product c...
We consider an edge computing scenario where users want to perform a lin...
We analyze the finite-length performance of spatially coupled low-densit...
We consider distributed and dynamic caching of coded content at small ba...
A private information retrieval (PIR) protocol guarantees that a user ca...
We consider near maximum-likelihood (ML) decoding of short linear block ...
Approaching capacity with low complexity is a very challenging task. In ...
We use density evolution to optimize the parameters of binary product co...
We present a novel decoding algorithm for q-ary low-density parity-check...
We consider the problem of tracking the state of a process that evolves ...
We propose a refined scaling law to predict the finite-length performanc...
High throughput and low complexity decoding algorithms are necessary in
...
We propose a novel binary message passing decoding algorithm for product...
Private information retrieval (PIR) protocols make it possible to retrie...
We propose a binary message passing decoding algorithm for product codes...
We implement a 1-Tb/s 0.63-pJ/bit soft-assisted product decoder in a 28-...