288 research outputs found

    A recent survey of permutation trinomials over finite fields

    Get PDF
    Constructing permutation polynomials is a hot topic in the area of finite fields, and permutation polynomials have many applications in different areas. Recently, several classes of permutation trinomials were constructed. In 2015, Hou surveyed the achievements of permutation polynomials and novel methods. But, very few were known at that time. Recently, many permutation binomials and trinomials have been constructed. Here we survey the significant contribution made to the construction of permutation trinomials over finite fields in recent years. Emphasis is placed on significant results and novel methods. The covered material is split into three aspects: the existence of permutation trinomials of the respective forms xrh(xs) x^{r}h(x^{s}) , Ξ»1xa+Ξ»2xb+Ξ»3xc \lambda_{1}x^{a}+\lambda_{2}x^{b}+\lambda_{3}x^{c} and x+xs(qmβˆ’1)+1+xt(qmβˆ’1)+1 x+x^{s(q^{m}-1)+1} +x^{t(q^{m}-1)+1} , with Niho-type exponents s,t s, t

    Determination of a Type of Permutation Trinomials over Finite Fields

    Full text link
    Let f=ax+bxq+x2qβˆ’1∈Fq[x]f=a{\tt x} +b{\tt x}^q+{\tt x}^{2q-1}\in\Bbb F_q[{\tt x}]. We find explicit conditions on aa and bb that are necessary and sufficient for ff to be a permutation polynomial of Fq2\Bbb F_{q^2}. This result allows us to solve a related problem. Let gn,q∈Fp[x]g_{n,q}\in\Bbb F_p[{\tt x}] (nβ‰₯0n\ge 0, p=char Fqp=\text{char}\,\Bbb F_q) be the polynomial defined by the functional equation βˆ‘c∈Fq(x+c)n=gn,q(xqβˆ’x)\sum_{c\in\Bbb F_q}({\tt x}+c)^n=g_{n,q}({\tt x}^q-{\tt x}). We determine all nn of the form n=qΞ±βˆ’qΞ²βˆ’1n=q^\alpha-q^\beta-1, Ξ±>Ξ²β‰₯0\alpha>\beta\ge 0, for which gn,qg_{n,q} is a permutation polynomial of Fq2\Bbb F_{q^2}.Comment: 28 page
    • …
    corecore