DocumentCode
923004
Title
The algebraic decoding of Goppa codes
Author
Patterson, N.J.
Volume
21
Issue
2
fYear
1975
fDate
3/1/1975 12:00:00 AM
Firstpage
203
Lastpage
207
Abstract
An interesting class of linear error-correcting codes has been found by Goppa [3], [4]. This paper presents algebraic decoding algorithms for the Goppa codes. These algorithms are only a little more complex than Berlekamp´s well-known algorithm for BCH codes and, in fact, make essential use of his procedure. Hence the cost of decoding a Goppa code is similar to the cost of decoding a BCH code of comparable block length.
Keywords
Decoding; Goppa codes; Art; Costs; Decoding; Electrons; Electrostatic precipitators; Galois fields; Information theory; Polynomials; Probability distribution; Reliability theory;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1975.1055350
Filename
1055350
Link To Document