DocumentCode :
934519
Title :
Decoding of erasures and errors for certain RS codes by decreased redundancy
Author :
Mandelbaum, David M.
Volume :
28
Issue :
2
fYear :
1982
fDate :
3/1/1982 12:00:00 AM
Firstpage :
330
Lastpage :
336
Abstract :
A method is presented for decoding erasures and errors in Reed-Solomon (RS) codes over GF 
. It uses fewer operations when the code is of medium or low rate, when the number of erasures is relatively large, and when 
is prime. This method can be used in conjunction with the customary method of decoding RS codes and can decrease the maximum number of operations needed to decode certain codes. This procedure is also applicable to generalized RS codes of length 
over GF .
. It uses fewer operations when the code is of medium or low rate, when the number of erasures is relatively large, and when is prime. This method can be used in conjunction with the customary method of decoding RS codes and can decrease the maximum number of operations needed to decode certain codes. This procedure is also applicable to generalized RS codes of length over GF .Keywords :
Reed-Solomon coding; Block codes; Computer errors; Crops; Decoding; Error correction codes; Galois fields; Interpolation; Probes; Redundancy; Reed-Solomon codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1982.1056478
Filename :
1056478
Link To Document :
