2000 character limit reached
On a conjecture about a class of permutation quadrinomials
Published 18 Sep 2019 in cs.IT, math.CO, and math.IT | (1909.08209v1)
Abstract: Very recently, Tu et al. presented a sufficient condition about $(a_1,a_2,a_3)$, see Theorem 1.1, such that $f(x) = x{3\cdot 2m} + a_1 x{2{m+1}+1}+ a_2 x{2m+2} + a_3 x3$ is a class of permutation polynomials over $\gf_{2{n}}$ with $n=2m$ and $m$ odd. In this present paper, we prove that the sufficient condition is also necessary.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.