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

Modified algebraic decoding of the binary (47, 24, 11) quadratic residue code

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)
Hung-Peng Lee ; Dept. of Comput. Sci. & Inf. Eng., Fortune Inst. of Technol., Kaohsiung, Taiwan ; Hsin-Chiu Chang

A modified algebraic decoding algorithm (ADA) is presented to decode up to five possible errors in a binary systematic (47, 24, 11) quadratic residue (QR) code. The main key points of the proposed ADA are to modify the erroneous conditions in Case 3, Case 4, and Case 5 of the ADA given in He et al. (2001) and to find out the true conditions from Case 2 to Case 5. The new conditions can also be applied to the ADA given in Lin et al. (2010). A simulation result shows that the decoding time of the proposed ADA is faster than that of ADA given in Lin et al. (2010).

Published in:

Consumer Electronics, Communications and Networks (CECNet), 2011 International Conference on

Date of Conference:

16-18 April 2011

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.