Finite fields
On the asymptotic number of inequivalent binary self-dual codes
Journal of Combinatorial Theory Series A
Two classes of permutation polynomials over finite fields
Journal of Combinatorial Theory Series A
New families of almost perfect nonlinear power mappings
IEEE Transactions on Information Theory
Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
IEEE Transactions on Information Theory
Reversed Dickson polynomials over finite fields
Finite Fields and Their Applications
Hi-index | 0.00 |
We give several necessary conditions for the reversed Dickson polynomial D"n(1,x) to be a permutation of F"q. In particular, we give explicit evaluation of @?"a"@?"F"""qD"n(1,a)^i for i=1,2.