Specific permutation polynomials over finite fields
Jose E. Marcos
TL;DR
This paper introduces new classes of permutation polynomials over finite fields, expanding the known families and providing tools for applications in coding theory and cryptography.
Contribution
The paper presents novel classes of permutation polynomials over finite fields, advancing the understanding of their structure and construction methods.
Findings
New permutation polynomial classes identified
Enhanced methods for constructing permutation polynomials
Potential applications in coding and cryptography
Abstract
We present new classes of permutation polynomials over finite fields.
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 · graph theory and CDMA systems