Hostname: page-component-76fb5796d-x4r87 Total loading time: 0 Render date: 2024-04-26T22:42:51.648Z Has data issue: false hasContentIssue false
  • English
  • Français

Binomial permutations of finite fields

Published online by Cambridge University Press:  17 April 2009

Wun-Seng Chou
Wun-Seng Chou
Affiliation:
Department of Mathematics, The Pennsylvania State University, University Park, PA 16802, United States of America
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We discuss permutation properties of a specific kind of binomials over finite fields. As a result, we complete Cavior's classification of binomial octic permutation polynomials over Fq with q odd.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 38 , Issue 3 , December 1988 , pp. 325 - 327
Copyright
Copyright © Australian Mathematical Society 1988

References

[1]Cavior, S.R., ‘A note on octic permutation polynomials’, Math. Comp. 17 (1963), 450–452.CrossRefGoogle Scholar
[2]Lidl, R. and Niederreiter, H., Finite Fields, (Encyclopedia Math. Appl., Vol. 20) (Addison-Wesley, Reading, Mass., 1983).Google Scholar
[3]Mollin, R.A. and Small, C., ‘On permutation polynomial over finite fields’, Internat. J. Math. Sci. 10 (1987), 536–543.CrossRefGoogle Scholar