Permutation Binomial Functions over Finite Fields
- Autores: Miloserdov A.V.1
-
Afiliações:
- Novosibirsk State University
- Edição: Volume 12, Nº 4 (2018)
- Páginas: 694-705
- Seção: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/213123
- DOI: https://doi.org/10.1134/S1990478918040105
- ID: 213123
Citar
Resumo
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.
Palavras-chave
Sobre autores
A. Miloserdov
Novosibirsk State University
Autor responsável pela correspondência
Email: amiloserdov6@gmail.com
Rússia, ul. Pirogova 2, Novosibirsk, 630090
Arquivos suplementares
