Permutations of finite fields for check digit systems
From MaRDI portal
Publication:1960224
DOI10.1007/S10623-010-9374-ZzbMath1248.11100OpenAlexW2141445884MaRDI QIDQ1960224
Publication date: 13 October 2010
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-010-9374-z
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06) Cyclotomy (11T22)
Related Items (11)
Large classes of permutation polynomials over \(\mathbb {F}_{q^2}\) ⋮ Unnamed Item ⋮ Coset-wise affine functions and cycle types of complete mappings ⋮ Complete mappings and Carlitz rank ⋮ Cycle types of complete mappings of finite fields ⋮ The existence of strong complete mappings of finite groups: a survey ⋮ On the difference between permutation polynomials ⋮ Compositions and parities of complete mappings and of orthomorphisms ⋮ Generalizations of complete mappings of finite fields and some applications ⋮ Strong complete mappings for 3-groups ⋮ Finite groups with an automorphism that is a complete mapping
Cites Work
This page was built for publication: Permutations of finite fields for check digit systems