Note on decoding binary Goppa codes
Author:
- 18 January 1996
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 32 (2) , 102-103
Abstract
The author gives a simple expression for the polynomial y(x) which solves the polynomial equation y(x)2 ≡ t(x) mod G(x), where t(x), y(x) and G(x) are polynomials over the field GF(2m). The solution of such an equation is a step in the so called Patterson algorithm for decoding binary Goppa codes. The result may also be useful for other applications.Keywords
This publication has 1 reference indexed in Scilit:
- The algebraic decoding of Goppa codesIEEE Transactions on Information Theory, 1975