Abstract
The author gives a simple expression for the polynomial y(x) which solves the polynomial equation y(x)/sup 2//spl equiv/t(x) mod G(x), where t(x), y(x) and G(x) are polynomials over the field GF(2/sup m/). 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
