Artigo Revisado por pares

The algebraic decoding of Goppa codes

1975; Institute of Electrical and Electronics Engineers; Volume: 21; Issue: 2 Linguagem: Inglês

10.1109/tit.1975.1055350

ISSN

1557-9654

Autores

Nicholas J. Patterson,

Tópico(s)

Error Correcting Code Techniques

Resumo

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.

Referência(s)