Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes

From MaRDI portal



Abstract: Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length n and fixed order r. An algorithm is designed that has complexity of order nlogn and corrects most error patterns of weight up to n(1/2−varepsilon) given that varepsilon exceeds n−1/2r. This improves the asymptotic bounds known for decoding RM codes with nonexponential complexity.











This page was built for publication: Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546822)