Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Nicholas J. Patterson (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: