Abstract
We consider recursive decoding for Reed-Muller (RM) codes and their subcodes. Two new recursive techniques are described. We analyze asymptotic properties of these algorithms and show that they substantially outperform other decoding algorithms with nonexponential complexity known for RM codes. Decoding performance is further enhanced by using intermediate code lists and permutation procedures. For moderate lengths up to 512, near-optimum decoding with feasible complexity is obtained.
This research was supported by the NSF grant CCR-0097125.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
I.S. Reed, “A class of multiple error correcting codes and the decoding scheme,” IEEE Trans. Info. Theory, vol. IT-4, pp. 38–49, 1954.
S.N. Litsyn, “On decoding complexity of low-rate Reed-Muller codes,” Proc. 9 th All-Union Conf. on Coding Theory and Info. Transmission, Part 1, Odessa, USSR, pp. 202–204, 1988 (in Russian).
G.A. Kabatyanskii, “On decoding of Reed-Muller codes in semicontinuous channels,” Proc. 2“ d Int. Workshop ”Algebr. and Comb.Coding Theory“, Leningrad, USSR, 1990, pp. 87–91 (in Russian).
F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1981.
R.E. Krichevskiy, “On the Number of Reed-Muller Code Correctable Errors,” Dokl. Soviet Acad. Sciences, vol. 191, pp. 541–547, 1970.
V. Sidel’nikov and A. Pershakov, “Decoding of Reed-Muller codes with a large number of errors,” Probl. Info. Transmission, vol. 28, no. 3, pp. 80–94, 1992.
G.D. Forney, “Coset codes-part II: Binary lattices and related codes,” IEEE Trans. Info. Theory, vol. 34, pp. 1152–1187, 1987.
W. Feller, An Introduction to Probability Theory and its Applications. New York: Wiley, vol. 2, 1971.
Y.S. Han, C.R.P. Hartmann, and C.K. Mohan, “Efficient heuristic search algorithms for soft-decision decoding of linear block codes,” IEEE Trans. Inform. Theory, vol. 44, pp. 3023–3038, 1998.
G. Schnabl and M. Bossert, “Soft-decision decoding of Reed-Muller Codes as generalized multiple concatenated codes,” IEEE Trans. Info. Theory, vol. 41, pp. 304–308, 1995.
I. Dumer and R. Krichevskiy, “Soft Decision Majority Decoding of Reed-Muller Codes,” IEEE Trans. Info. Theory, vol. 46, pp. 258264, Jan. 2000.
I. Dumer, “Recursive decoding of Reed-Muller codes,” Proc. 37 th Allerton Conf. on Commun., Cont., and Comp., Monticello, IL, Sept. 22–24, 1999, pp. 61–69.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Dumer, I., Shabunov, K. (2002). Recursive List Decoding for Reed-Muller Codes and Their Subcodes. In: Blaum, M., Farrell, P.G., van Tilborg, H.C.A. (eds) Information, Coding and Mathematics. The Springer International Series in Engineering and Computer Science, vol 687. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3585-7_17
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3585-7_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5289-9
Online ISBN: 978-1-4757-3585-7
eBook Packages: Springer Book Archive