Landmark codes underpin reliable physical layer communication, eg, Reed-Muller, BCH,
Convolution, Turbo, LDPC, and Polar codes: each is a linear code and represents a …

There have been significant research activities in recent years to automate the design of
channel encoders and decoders via deep learning. Due the dimensionality challenge in …

Progress in designing channel codes has been driven by human ingenuity and, fittingly, has
been sporadic. Polar codes, developed on the foundation of Arikan's polarization kernel …

We consider the problem of coded distributed computing where a large linear computational
job, such as a matrix multiplication, is divided into smaller tasks, encoded using an linear …

Reed-Muller (RM) codes achieve the capacity of general binary-input memoryless
symmetric channels and are conjectured to have a comparable performance to that of …

We present a low-complexity and low-latency decoding algorithm for a class of Reed-Muller
(RM) subcodes that are defined based on the product of smaller RM codes. More …

While decades of theoretical research have led to the invention of several classes of error-
correction codes, the design of such codes is an extremely challenging task, mostly driven …

The recursive projection-aggregation (RPA) algorithm provides state-of-the-art performance
for Reed-Muller (RM) codes. It relies on projecting onto subspaces, decoding projections …

We present a novel iterative decoding algorithm for Reed-Muller (RM) codes, which takes
advantage of a graph representation of the code. Vertices of the considered graph …

This paper proposes Dense KO (DKO) codes to enhance the recently introduced KO coding
framework for faster convergence and reduced model complexity. The key idea is to replace …