Recursive constructions and their maximum likelihood decoding
Ilya Dumer, Kirill Shabunov·2017-03-15·via cs.IT updates on arXiv.org
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.