Email this article Permutation Binomial Functions over Finite Fields
- Authors: Miloserdov A.V.1
-
Affiliations:
- Novosibirsk State University
- Issue: Vol 12, No 4 (2018)
- Pages: 694-705
- Section: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/213123
- DOI: https://doi.org/10.1134/S1990478918040105
- ID: 213123
Cite item
Open Access
Access granted
Subscription Access
Abstract
We consider binomial functions over a finite field of order 2n. Some necessary condition is found for such a binomial function to be a permutation. It is proved that there are no permutation binomial functions in the case that 2n − 1 is prime. Permutation binomial functions are constructed in the case when n is composite and found for n ≥ 8.
About the authors
A. V. Miloserdov
Novosibirsk State University
Author for correspondence.
Email: amiloserdov6@gmail.com
Russian Federation, ul. Pirogova 2, Novosibirsk, 630090
Supplementary files
