Construction of Permutation Polynomials over Finite Fields with the help of SCR polynomials
In this paper we take a deeper look at the self conjugate reciprocal (SCR) polynomials, which towards the end of the paper aid the construction of new classes of permutation polynomials of simpler forms over $\mathbb{F}_{q^{2}}$. The paper focuses on the conditions required for a certain class of degree 2 and degree 3 SCR polynomials to have no roots in $\mu_{q+1}$ (the set of $(q+1)-\emph{th}$ roots of unity), which helps in the determination of polynomials that permute $\mathbb{F}_{q^{2}}$. In the due course we also look upon some higher degree SCR polynomials which can be reduced down to a degree 2 SCR polynomial over both odd and even ordered fields. We further look upon the SCR polynomials of type $ax^{q+1}+bx^{q}+bx+a^{q}$ taking both the cases under consideration viz. $a\in \mathbb{F}_{q}$ and $a\in\mathbb{F}_{q^{2}}\setminus\mathbb{F}_{q}$.
Authors
- Dhiren Kumar Basnet (ORCID: https://orcid.org/0000-0002-9589-9287)
- Bidushi Sharma
Publication Details
- Journal
- DergiPark (Istanbul University)
- Published
- 2025-03-10
- DOI
- https://doi.org/10.15672/hujms.1643470
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00