Recursive Decoding and Its Performance for Low-Rate Reed-Muller Codes
Information Theory
2017-03-17 v1 math.IT
Abstract
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length and fixed order An algorithm is designed that has complexity of order and corrects most error patterns of weight up to given that exceeds This improves the asymptotic bounds known for decoding RM codes with nonexponential complexity.
Keywords
Cite
@article{arxiv.1703.05306,
title = {Recursive Decoding and Its Performance for Low-Rate Reed-Muller Codes},
author = {Ilya Dumer},
journal= {arXiv preprint arXiv:1703.05306},
year = {2017}
}