Enumeration of a class of sequences generated by inversions

The system is temporarily closed to updates for reporting purpose. 
Çeşmelioğlu, Ayça and Meidl, Wilfried and Topuzoğlu, Alev (2008) Enumeration of a class of sequences generated by inversions. In: 1st International Workshop on Coding and Cryptology, Fujian, China AbstractAny permutation of a finite field Fq can be represented by a polynomial Pn(x) = (. . . ((a(0)x a(1))(q2) + a(2))(q2) ... a(n))(q2) + a(n+1), for some n >= 0. In this note we present the number of distinct permutations of the types P2(x) and P3(x) with full cycle. These results extend earlier work on the inversive pseudorandom number generator and on P1. Item Type:  Papers in Conference Proceedings 

Uncontrolled Keywords:  Pseudorandom number generators; Inversive generator; Sequences over finite fields; Permutation Polynomials; Enumeration of Permutation Polynomials 

Subjects:  Q Science > QA Mathematics 

ID Code:  14177 

Deposited By:  Alev Topuzoğlu 

Deposited On:  26 Jul 2010 16:06 

Last Modified:  25 Jul 2019 11:22 

Repository Staff Only: item control page
