By Topic

Fast transform decoding of nonsystematic Reed-Solomon 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 $31
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

4 Author(s)
Shiozaki, A. ; Osaka Electro-Commun. Univ., Japan ; Truong, T.K. ; Cheung, K.M. ; Reed, I.S.

By considering a Reed-Solomon (RS) code to be a special case of a redundant residue polynomial code, a fast transform decoding algorithm to correct both errors and erasures is presented. This decoding scheme is an improvement of the decoding algorithm for the redundant residue polynomial code suggested by Shiozaki and Nishida (1975). This decoding scheme can be realised readily on VLSI chips.

Published in:

Computers and Digital Techniques, IEE Proceedings E  (Volume:137 ,  Issue: 2 )