Skip to Main content Skip to Navigation
New interface
Journal articles

Permutations via linear translators

Abstract : We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first characterize some functions having linear translators, based on which several families of permutations are then derived. Extending the results of \cite{kyu}, we give in several cases the compositional inverse of these permutations. The connection with complete permutations is also utilized to provide further infinite classes of permutations. Moreover, we propose new tools to study permutations of the form $x\mapsto x+(x^{p^m}-x+\delta)^s$ and a few infinite classes of permutations of this form are proposed.
Document type :
Journal articles
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : pascale Charpin Connect in order to contact the contributor
Submitted on : Monday, December 12, 2016 - 2:21:05 PM
Last modification on : Friday, July 8, 2022 - 10:10:16 AM
Long-term archiving on: : Monday, March 27, 2017 - 7:26:59 PM


Files produced by the author(s)




Nastja Cepak, Pascale Charpin, Enes Pasalic. Permutations via linear translators. Finite Fields and Their Applications, 2017, 45, pp.19--42. ⟨10.1016/j.ffa.2016.11.009⟩. ⟨hal-01412487v2⟩



Record views


Files downloads