Cycle structure of permutation functions over finite fields and their applications

DOI10.3934/AMC.2012.6.347MaRDI QIDQ1760069zbMATH OpenOpenAlexFDO

Authors Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario

Publication date 12 November 2012

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1011.1539

zbMATH Keywords

Dickson polynomialsInterleaversMöbius transformationpermutation functions over finite fieldsRédei functionsSkolem sequencesturbo codes

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Finite fields (field-theoretic aspects) (12E20) Other types of codes (94B60)

Abstract: In this work we establish some new interleavers based on permutation functions. The inverses of these interleavers are known over a finite field $mathbb{F}_q$. For the first time M"{o}bius and R'edei functions are used to give new deterministic interleavers. Furthermore we employ Skolem sequences in order to find new interleavers with known cycle structure. In the case of R'edei functions an exact formula for the inverse function is derived. The cycle structure of R'edei functions is also investigated. The self-inverse and non-self-inverse versions of these permutation functions can be used to construct new interleavers.

Review text

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.

Recommendations

• scientific article; zbMATH DE number 4051761
• Permutations on finite fields with invariant cycle structure on lines
• Rédei permutations with cycles of the same length
• PERMUTATION FUNCTIONS ARISING FROM INTERPOLATIONS
• A Note on Permutation Polynomials Over $\BBZ _{n}$

Cited in

(14)

• Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)
• Rédei permutations with cycles of the same length
• Fixed points of rational functions satisfying the Carlitz property
• Permutations of finite fields with prescribed properties
• Groups of permutations generated by function-linear translator pairs
• Cycle structure of iterating Rédei functions
• Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme
• The cycle structure of a class of permutation polynomials
• Rédei Actions on Finite Fields and Multiplication Map in Cyclic Group
• PERMUTATION FUNCTIONS ARISING FROM INTERPOLATIONS
• A general construction of regular complete permutation polynomials
• The state diagram of $$\chi $$
• Regular complete permutation polynomials over quadratic extension fields
• Cycles of linear permutations over a finite field

This page was built for publication: Cycle structure of permutation functions over finite fields and their applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1760069)