On some permutation polynomials over finite fields

Amir Akbary and Qiang Wang

International Journal of Mathematics and Mathematical Sciences, 2005, vol. 2005, 1-10

Abstract:

Let p be prime, q = p m , and q − 1 = 7 s . We completely describe the permutation behavior of the binomial P ( x ) = x r ( 1 + x e s ) ( 1 ≤ e ≤ 6 ) over a finite field F q in terms of the sequence { a n } defined by the recurrence relation a n = a n − 1 + 2 a n − 2 − a n − 3 ( n ≥ 3 ) with initial values a 0 = 3 , a 1 = 1 , and a 2 = 5 .

Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2005/716785.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2005/716785.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:716785

DOI: 10.1155/IJMMS.2005.2631

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().