Permutation Binomial Functions over Finite Fields
- 作者: Miloserdov A.V.1
-
隶属关系:
- Novosibirsk State University
- 期: 卷 12, 编号 4 (2018)
- 页面: 694-705
- 栏目: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/213123
- DOI: https://doi.org/10.1134/S1990478918040105
- ID: 213123
如何引用文章
详细
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.
作者简介
A. Miloserdov
Novosibirsk State University
编辑信件的主要联系方式.
Email: amiloserdov6@gmail.com
俄罗斯联邦, ul. Pirogova 2, Novosibirsk, 630090
补充文件
