Cart (Loading....) | Create Account
Close category search window

Error exponents for two soft decision decoding algorithms of Reed-Muller codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Burnashev, M. ; Inst. for Inf. Transm. Problems, Moscow ; Dumer, I.

Error exponents are studied for the recursive and majority decoding algorithms of general Reed-Muller codes RM(r, m) used on the AWGN channels. Both algorithms have low decoding complexity and substantially outperform bounded distance decoding in their error-correcting capabilities. We obtain asymptotically tight upper bounds on the output error rate that hold for both algorithms and can be used for any RM-code.

Published in:

Information Theory, 2008. ISIT 2008. IEEE International Symposium on

Date of Conference:

6-11 July 2008

Need Help?

IEEE Advancing Technology for Humanity 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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.