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 …

In this paper, we investigate covert communication over millimeter-wave (mmWave)
frequencies. In particular, a mmWave transmitter, referred to as Alice, attempts to reliably …

This work proves new results on the ability of binary Reed-Muller codes to decode from
random errors and erasures. Specifically, we prove that RM codes with m variables and …

Constructing efficient low-rate error-correcting codes with low-complexity encoding and
decoding has become increasingly important for applications involving ultra-low-power …

Let denote the maximum size of a binary code of length and minimum Hamming distance.
Studying, including efforts to determine it as well to derive bounds on for large's, is one of the …

In this paper, we present a low-complexity recursive approach for massive and scalable
code-domain nonorthogonal multiple access (NOMA) with applications to emerging low …

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 …

Concatenating the state-of-the-art codes at moderate rates with repetition codes has
emerged as a practical solution deployed in various standards for ultra-low-power devices …

Constructing efficient low-rate error-correcting codes with low-complexity encoding and
decoding have become increasingly important for applications involving ultra-low-power …

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 …