Recursive constructions and their maximum likelihood decoding
arXiv:1703.05302
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.