Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels
Consider a binary linear code of length N, minimum distance d-{\min}, transmission over the binary erasure channel with parameter 0 < \epsilon < 1 or the binary symmetric channel with parameter 0 < \epsilon < \frac{1}{2}, and block-MAP decoding. It was shown by Tillich and Zemor that in...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
IEEE
2019
|
Online Access: | https://hdl.handle.net/1721.1/121969 |