Complete mapping polynomials over finite field F16

19Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A polynomial f(x) over Fq, the finite field with q elements, is called a complete mapping polynomial if the two mappings Fq → Fq respectively defined by f(x) and f(x) + x are one-to-one. In this correspondence, complete mapping polynomials over F16 are considered. The nonexistence of the complete mapping polynomial of degree 9 and the existence of the ones of degree 8 and 11 are proved; the result that the reduced degree of complete mapping polynomials over F16 are 1, 4, 8, 10, 11, 12, 13 is presented; and by searching with computer, the degree distribution of complete mapping polynomials over the field is given. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Yuan, Y., Tong, Y., & Zhang, H. (2007). Complete mapping polynomials over finite field F16. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4547 LNCS, pp. 147–158). Springer Verlag. https://doi.org/10.1007/978-3-540-73074-3_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free