Nonexistence of Permutation Binomials of Certain Shapes
نویسندگان
چکیده
Suppose xm+axn is a permutation polynomial over Fp, where p > 5 is prime and m > n > 0 and a ∈ Fp. We prove that gcd(m−n, p−1) / ∈ {2, 4}. In the special case that either (p− 1)/2 or (p− 1)/4 is prime, this was conjectured in a recent paper by Masuda, Panario and Wang.
منابع مشابه
New classes of permutation binomials and permutation trinomials over finite fields
Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinational design, communication theory and so on. Permutation binomials and trinomials attract people’s interest due to their simple algebraic form and additional extraordinary properties. In t...
متن کاملOn the nonexistence of completely transitive codes
Completely transitive codes were introduced by P. Solé as a special case of binary linear completely regular codes. The existence of such codes is closely related to the existence of certain permutation groups. The nonexistence of highly transitive permutation groups allows us to prove the nonexistence of completely transitive codes with error-correcting capability greater than 4.
متن کاملThe Number of Permutation Binomials over F4p+1 where p and 4p+1 are Primes
We give a characterization of permutation polynomials over a finite field based on their coefficients, similar to Hermite’s Criterion. Then, we use this result to obtain a formula for the total number of monic permutation binomials of degree less than 4p over F4p+1, where p and 4p + 1 are primes, in terms of the numbers of three special types of permutation binomials. We also briefly discuss th...
متن کاملCompositional inverses, complete mappings, orthogonal Latin squares and bent functions
We study compositional inverses of permutation polynomials, complete map-pings, mutually orthogonal Latin squares, and bent vectorial functions. Recently it was obtained in [33] the compositional inverses of linearized permutation binomials over finite fields. It was also noted in [29] that computing inverses of bijections of subspaces have applications in determining the compositional inverses...
متن کاملA Generalized Lucas Sequence and Permutation Binomials
Let p be an odd prime and q = pm. Let l be an odd positive integer. Let p ≡ −1 (mod l) or p ≡ 1 (mod l) and l | m. By employing the integer sequence an = l−1 2 ∑ t=1 ( 2 cos π(2t− 1) l )n , which can be considered as a generalized Lucas sequence, we construct all the permutation binomials P (x) = xr + xu of the finite field Fq .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 14 شماره
صفحات -
تاریخ انتشار 2007