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: | Ordentlich, Or, Polyanskiy, Yury |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
IEEE
2019
|
Online Access: | https://hdl.handle.net/1721.1/121969 |
Similar Items
-
On viterbi-like algorithms and their application to Reed–Muller codes
by: Ling, San, et al.
Published: (2013) -
Optimisation of reed-muller circuits
by: Yang, Hong
Published: (2009) -
Graceful degradation over the BEC via non-linear codes
by: Hosseini Roozbehani, Hajir, et al.
Published: (2021) -
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding
by: Kochman, Yuval, et al.
Published: (2021) -
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding
by: Kochman, Yuval, et al.
Published: (2021)