Recursive constructions and their maximum likelihood decoding
Information Theory
2017-03-17 v1 math.IT
Abstract
We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible complexity.
Cite
@article{arxiv.1703.05302,
title = {Recursive constructions and their maximum likelihood decoding},
author = {Ilya Dumer and Kirill Shabunov},
journal= {arXiv preprint arXiv:1703.05302},
year = {2017}
}