Permutation polynomials over finite fields by the local criterion
Danyao Wu, Pingzhi Yuan

TL;DR
This paper explores permutation polynomials over finite fields using a local criterion, introduces new classes and inverses, and examines their properties relative to linear transformations.
Contribution
It introduces a new class of permutation polynomials and their inverses over finite fields, expanding understanding of local permutation properties.
Findings
Linearized polynomials are local permutation polynomials under all linear transformations.
Every permutation polynomial is a local permutation polynomial with respect to certain mappings.
The paper provides a new criterion for identifying permutation polynomials over finite fields.
Abstract
In this paper, we further investigate the local criterion and present a class of permutation polynomials and their compositional inverses over . Additionally, we demonstrate that linearized polynomial over is a local permutation polynomial with respect to all linear transformations from to and that every permutation polynomial is a local permutation polynomial with respect to certain mappings.
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 · graph theory and CDMA systems · Cooperative Communication and Network Coding
