Abstract

Permutation polynomials have important applications in cryptography, coding theory, combinatorial designs, and other areas of mathematics and engineering. Finding new classes of permutation polynomials is therefore an interesting subject of study. In this paper, for an integer s satisfying \(s=\frac{q^n-1}{2}+q^r\), we give six classes of permutation polynomials of the form \((ax^{q^m}-bx+\delta )^s+L(x)\) over \(\mathbb {F}_{q^n}\), and for s satisfying \(s(p^m-1)\equiv p^m-1\ (mod\ p^n-1)\) or \(s(p^{{\frac{k}{2}}m}-1)\equiv p^{km}-1 (mod\ p^n-1)\), we propose three classes of permutation polynomials of the form \((aTr_m^n(x)+\delta )^s+L(x)\) over \(\mathbb {F}_{p^n}\), respectively.

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.