A note regarding permutation binomials over finite fields
Stephen Lappano

TL;DR
This paper investigates specific permutation polynomials over finite fields, providing explicit conditions on parameters for when these polynomials permute the field elements.
Contribution
It offers explicit criteria for permutation behavior of certain binomials over finite fields, focusing on cases where r is 5 or 7.
Findings
Derived explicit conditions for permutation polynomials with r=5 or 7.
Identified parameter ranges (q, a) ensuring permutation properties.
Enhanced understanding of permutation binomials over finite fields.
Abstract
Let We give explicit conditions on the values for which is a permutation polynomials of
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cooperative Communication and Network Coding · Advanced Wireless Communication Techniques
