DocumentCode :
927017
Title :
On the complexity of decoding Goppa codes (Corresp.)
Author :
Sarwate, Dilip V.
Volume :
23
Issue :
4
fYear :
1977
fDate :
7/1/1977 12:00:00 AM
Firstpage :
515
Lastpage :
516
Abstract :
It is shown that i) erasures-and-errors decoding of Goppa codes can be done using 
arithmetic operations, ii) long primitive binary Bose-Chaudhuri-Hocquenghem (BCH) codes can be decoded using 
arithmetic operations, and iii) Justesen\´s asymptotically good codes can be decoded using 
bit operations. These results are based on the application of efficient computational techniques to the decoding algorithms recently discovered by Sugiyama, Kasahara, Hirasawa, and Namekawa.
arithmetic operations, ii) long primitive binary Bose-Chaudhuri-Hocquenghem (BCH) codes can be decoded using arithmetic operations, and iii) Justesen\´s asymptotically good codes can be decoded using bit operations. These results are based on the application of efficient computational techniques to the decoding algorithms recently discovered by Sugiyama, Kasahara, Hirasawa, and Namekawa.Keywords :
BCH codes; Decoding; Error-correcting codes; Goppa codes; Arithmetic; Decoding; Equations; Polynomials; Reed-Solomon codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1977.1055732
Filename :
1055732
Link To Document :
