论文信息 - Four classes of permutation polynomials of F2m

Four classes of permutation polynomials of F2m

Permutation polynomials have been a subject of study for over 140 years and have applications in many areas of science and engineering. However, only a handful of specific classes of permutation polynomials are known so far. In this paper we describe four classes of permutation polynomials over F"2"^"m. Two of the four classes have the same form, while the other two classes are of different forms. Our work is motivated by a recent paper by Helleseth and Zinoviev.

Cunsheng Ding | Jin Yuan | C. Ding | Jin Yuan

[1] Marie Henderson,et al. Permutations amongst the Dembowski-Ostrom polynomials , 2001 .

[2] Tor Helleseth,et al. New Kloosterman sums identities over F2m for all m , 2003 .

[3] C.J. Corrada Bravo,et al. Permutation polynomials for interleavers in turbo codes , 2003, IEEE International Symposium on Information Theory. Proceedings.

[4] J. Hirschfeld,et al. The packing problem in statistics, coding theory and finite projective spaces : update 2001 , 2001 .

[5] Wang Daqing,et al. Permutation polynomials over finite fields , 1987 .

[6] Rudolf Lide,et al. Finite fields , 1983 .

[7] Hans Dobbertin. Uniformly Representable Permutation Polynomials , 2001, SETA.

[8] Jing Sun,et al. Interleavers for turbo codes using permutation polynomials over integer rings , 2005, IEEE Transactions on Information Theory.

[9] Henk D. L. Hollmann,et al. A class of permutation polynomials of F2m related to Dickson polynomials , 2005, Finite Fields Their Appl..

[10] Simeon Ball,et al. Symplectic Spreads and Permutation Polynomials , 2003, International Conference on Finite Fields and Applications.