Cycle structure of permutation functions over finite fields and their applications (Q1760069)

Let \(I=\{0,1,\dots, N-1\}\) the indices of a vector \({\mathbf u}= (u_0,u_1, \dots u_{N-1})\). An interleaver is an element of the permutation group of \(N\) elements, where the group operation is defined by compositions of mappings. A permutation function over a finite field \(\mathbb F_q\) is a bijection on \(\mathbb F_q\). In this paper some permutation functions over \(\mathbb F_q\) (as monomials, Dickson polynomials, Möbius transformation and Rédei functions) and Skolem sequences are used for construction of new deterministic interleavers. Here the cyclic structure of the permutation functions and generalized Skolem sequences are used. Meanwhile, Rédei functions with a given cycle of length are characterized and an exact formula for the number of cycles of this length is given.