Referenced Items are not available for this document.
Soft-decision decoding is considered for general Reed-Muller (RM) codes of length n and distance d used over a memoryless channel. A recursive decoding algorithm is designed and its decoding threshold is derived for long RM codes. The algorithm has complexity of order nlnn and corrects most error patterns of the Euclidean weight of order radicn/lnn, instead of the decoding threshold radicd/2 of the bounded distance decoding. Also, for long RM codes of fixed rate R, the new algorithm increases 4/pi times the decoding threshold of its hard-decision counterpart
Published in:
Information Theory, IEEE Transactions on
(Volume:52
,
Issue:
3
)
Date of Publication: March 2006
- Page(s):
- 954 - 963
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 8819745
- Digital Object Identifier :
- 10.1109/TIT.2005.864425
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 March 2006
- Issue Date :
- March 2006
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
