Achieving Capacity on Non-Binary Channels with Generalized Reed-Muller Codes

05/12/2023
by   Galen Reeves, et al.
0

Recently, the authors showed that Reed-Muller (RM) codes achieve capacity on binary memoryless symmetric (BMS) channels with respect to bit error rate. This paper extends that work by showing that RM codes defined on non-binary fields, known as generalized RM codes, achieve capacity on sufficiently symmetric non-binary channels with respect to symbol error rate. The new proof also simplifies the previous approach (for BMS channels) in a variety of ways that may be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2021

Reed-Muller Codes Achieve Capacity on BMS Channels

This paper considers the performance of long Reed-Muller (RM) codes tran...
research
04/05/2023

A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels

Reed-Muller codes were introduced in 1954, with a simple explicit constr...
research
02/21/2022

Berman Codes: A Generalization of Reed-Muller Codes that Achieve BEC Capacity

We identify a family of binary codes whose structure is similar to Reed-...
research
05/13/2020

Stealth Communication with Vanishing Power over Binary Symmetric Channels

A framework for stealth communication with vanishing power (VP) is prese...
research
05/11/2023

On the Advantages of Asynchrony in the Unsourced MAC

In this work we demonstrate how a lack of synchronization can in fact be...
research
10/27/2020

Algorithms for q-ary Error-Correcting Codes with Limited Magnitude and Feedback

Berlekamp and Zigangirov completely determined the capacity error functi...
research
01/30/2022

Efficient Near-Optimal Codes for General Repeat Channels

Given a probability distribution 𝒟 over the non-negative integers, a 𝒟-r...

Please sign up or login with your details

Forgot password? Click here to reset