Permutation polynomials with a few terms over finite fields
This paper considers permutation polynomials over the finite field $ \mathbb F_{q^2} $ by utilizing low-degree permutation rational functions over $ \mathbb F_q $, where $ q $ is a prime power. As a result, we obtain two classes of permutation binomials, six classes of permutation quadrinomials and six classes of permutation pentanomials over $ \mathbb F_{q^2} $. Additionally, we show that the obtained binomials, quadrinomials and pentanomials are quasi-multiplicative inequivalent to the known ones in the literature.
Authors
- Kirpa Garg (ORCID: https://orcid.org/0009-0003-8680-0235)
- Sartaj Ul Hasan (ORCID: https://orcid.org/0000-0002-7962-3221)
- Mohit Pal (ORCID: https://orcid.org/0000-0002-6464-7124)
- Harish Kumar (ORCID: https://orcid.org/0000-0002-1393-3905)
- Chunlei Li (ORCID: https://orcid.org/0000-0002-3792-769X)
Institutions
- Indian Institute of Technology Jammu (IN)
- University of Bergen (NO)
Publication Details
- Journal
- Advances in Mathematics of Communications
- Published
- 2025-08-26
- DOI
- https://doi.org/10.3934/amc.2025040
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Norges Forskningsråd
- Science and Engineering Research Board