Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

01/29/2018
by   Hamed Hassani, et al.
0

Consider a binary linear code of length N, minimum distance d_min, transmission over the binary erasure channel with parameter 0 < ϵ < 1 or the binary symmetric channel with parameter 0 < ϵ < 1/2, and block-MAP decoding. It was shown by Tillich and Zemor that in this case the error probability of the block-MAP decoder transitions "quickly" from δ to 1-δ for any δ>0 if the minimum distance is large. In particular the width of the transition is of order O(1/√(d_min)). We strengthen this result by showing that under suitable conditions on the weight distribution of the code, the transition width can be as small as Θ(1/N^1/2-κ), for any κ>0, even if the minimum distance of the code is not linear. This condition applies e.g., to Reed-Mueller codes. Since Θ(1/N^1/2) is the smallest transition possible for any code, we speak of "almost" optimal scaling. We emphasize that the width of the transition says nothing about the location of the transition. Therefore this result has no bearing on whether a code is capacity-achieving or not. As a second contribution, we present a new estimate on the derivative of the EXIT function, the proof of which is based on the Blowing-Up Lemma.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2023

On Decoder Ties for the Binary Symmetric Channel with Arbitrarily Distributed Input

The error probability of block codes sent under a non-uniform input dist...
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
06/10/2022

On some properties of random and pseudorandom codes

We describe some pseudorandom properties of binary linear codes achievin...
research
06/13/2020

On Optimal Finite-length Binary Codes of Four Codewords for Binary Symmetric Channels

Finite-length binary codes of four codewords are studied for memoryless ...
research
09/03/2018

Minimum Description Length codes are critical

Learning from the data, in Minimum Description Length (MDL), is equivale...
research
08/30/2022

Optimal possibly nonlinear 3-PIR codes of small size

First, we state a generalization of the minimum-distance bound for PIR c...
research
03/01/2020

Optimal Upward Scaling of Minimum-TSC Binary Signature Sets

We consider upward scaling an overloaded min-TSC binary signature set an...

Please sign up or login with your details

Forgot password? Click here to reset