By Topic

Efficient program for decoding the (255, 223) Reed-Solomon code over GF (28 ) with both errors and erasures, using transform decoding

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

3 Author(s)
Miller, R.L. ; Jet Propulsion Laboratory, Communication Systems Research Section, Pasadena, USA ; Truong, T.K. ; Reed, I.S.

To decode a (255, 223) Reed-Solomon code over GF(28), a fast Fourier-like transform over GF(28) has been developed to compute the syndromes and the error-erasure vectors of the transmitted code words. This new simplified transform decoder is implemented in a program on a digital computer. The (255, 223) Reed-Solomon code over GF(28) is being proposed as a NASA standard for concatenation with a (7, 1/2) conventional code. In a simulation, random code words were corrupted by random error and erasure patterns, and decoded whenever theoretically possible. A matrix of execution times for this new transform decoder under varying sets of errors and erasure patterns is included in the paper. This matrix demonstrates that the speed of the new decoder is between three and seven times faster than the software R¿¿S decoder developed previously by NASA.

Published in:

Computers and Digital Techniques, IEE Proceedings E  (Volume:127 ,  Issue: 4 )