Recursive Decoding and Its Performance for Low-Rate Reed-Muller Codes
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 n n and corrects most error patterns of weight up to n(1/2-) given that exceeds n-1/2r. This improves the asymptotic bounds known for decoding RM codes with nonexponential complexity.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.