Abstract

This paper provides a new proof of the fact that the polynomials of degree $2^{m-2}$ over the Galois field $GF(2^m) (m \geq 2)$, which are fully reducible and admit no multiple factor (i.e., which divide x^{2^m} + x$) and whose derivatives are constant are affine polynomials. The author determines explicitly these polynomials, which are related to a problem in coding theory that is recounted.

Full Text
Paper version not known

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 call

Disclaimer: 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.