Permutation Binomial Functions over Finite Fields


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2018