Enumeration of a class of sequences generated by inversions

Warning 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

[thumbnail of aaw.proc.iwcc.pdf] PDF
aaw.proc.iwcc.pdf
Restricted to Registered users only

Download (215kB) | Request a copy

Abstract

Any permutation of a finite field F-q can be represented by a polynomial P-n(x) = (. . . ((a(0)x a(1))(q-2) + a(2))(q-2) ... a(n))(q-2) + a(n+1), for some n >= 0. In this note we present the number of distinct permutations of the types P-2(x) and P-3(x) with full cycle. These results extend earlier work on the inversive pseudorandom number generator and on P-1.
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
Divisions: Faculty of Engineering and Natural Sciences > Basic Sciences > Mathematics
Faculty of Engineering and Natural Sciences
Depositing User: Alev Topuzoğlu
Date Deposited: 26 Jul 2010 16:06
Last Modified: 26 Apr 2022 08:56
URI: https://research.sabanciuniv.edu/id/eprint/14177

Actions (login required)

View Item
View Item