Some new results on permutation trinomials over finite fields with even characteristic
Kirpa Garg, Sartaj Ul Hasan, Chandan Kumar Vishwakarma

TL;DR
This paper introduces three new classes of permutation trinomials over finite fields with even characteristic, analyzes their equivalence to existing classes, and proves a nonexistence result for a specific case, also confirming a recent conjecture.
Contribution
The paper constructs three new classes of permutation trinomials over _{2^{2m}} and analyzes their equivalence, also proving a nonexistence result and confirming a recent conjecture.
Findings
Three new classes of permutation trinomials are constructed.
The quasi-multiplicative equivalence of new and existing classes is analyzed.
A nonexistence result for certain parameters is proved.
Abstract
The construction of permutation trinomials of the form over , where are positive integers, is an active area of research. Several classes of permutation trinomials with fixed values of , and have been studied. Here, we construct three new classes of permutation trinomials with over . We also analyze the quasi-multiplicative equivalence of the newly obtained classes of permutation trinomials to both the existing ones and to each other. Additionally, we prove the nonexistence of a class of permutation trinomials over of the same type for , , and when . Furthermore, we provide a proof for a conjecture on the quasi-multiplicative equivalence of two classes of permutation…
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
