Abstract
Permutation polynomials of finite fields have many applications in cryptography, coding theory, and combinatorics. In the first part we mention some applications of a class of permutation polynomials with additional features which includes complete mappings and orthomorphisms. In the second part we discuss several constructions. We focus on linearized polynomials and cyclotomic polynomials of degree 2.
Sign-in/Register to access full text options 
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.
