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

Decoding of redundant residue polynomial codes using Euclid's algorithm

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

1 Author(s)
Shiozaki, A. ; Fac. of Eng., Osaka Electro-Commun. Univ., Japan

A decoding method is proposed for the redundant residue polynomial codes, a class that includes Reed-Solomon codes. The method is based on properties of Euclid's algorithm. The advantage of the method is that the computation of both the error-locator polynomial and the error-evaluator polynomial needed in conventional decoding methods can be avoided. The method is suitable for decoding concatenated codes whose outer codes are redundant residue polynomial codes, since they are easily decoded by ignoring erasures detected in the inner codes

Published in:

Information Theory, IEEE Transactions on  (Volume:34 ,  Issue: 5 )

Date of Publication:

Sep 1988

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.