The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

Determination of a type of permutation trinomials over finite fields

Xiang-dong Hou — 2014

Acta Arithmetica

Let f = a x + b x q + x 2 q - 1 q [ x ] . We find explicit conditions on a and b that are necessary and sufficient for f to be a permutation polynomial of q ² . This result allows us to solve a related problem: Let g n , q p [ x ] (n ≥ 0, p = c h a r q ) be the polynomial defined by the functional equation c q ( x + c ) n = g n , q ( x q - x ) . We determine all n of the form n = q α - q β - 1 , α > β ≥ 0, for which g n , q is a permutation polynomial of q ² .

A class of permutation trinomials over finite fields

Xiang-dong Hou — 2014

Acta Arithmetica

Let q > 2 be a prime power and f = - x + t x q + x 2 q - 1 , where t * q . We prove that f is a permutation polynomial of q ² if and only if one of the following occurs: (i) q is even and T r q / 2 ( 1 / t ) = 0 ; (ii) q ≡ 1 (mod 8) and t² = -2.

Page 1

Download Results (CSV)