Results 21 to 30 of about 98,739 (338)
Specific permutation polynomials over finite fields [PDF]
Finite Fields and Their Applications, 2011 Withdrawn by the author [conflict of copyright]
Marcos, José E.
openaire +4 more sources
On the evaluation of multivariate polynomials over finite fields
Journal of Symbolic Computation, 2013 A method to evaluate multivariate polynomials over a finite field is described and its multiplicative complexity is discussed.
Edoardo Ballico, Massimiliano Sala
exaly +3 more sources
Factorization of polynomials over finite fields. [PDF]
Pacific Journal of Mathematics, 1962 R. G. Swan
semanticscholar +3 more sources
Reversed Dickson polynomials over finite fields [PDF]
Finite Fields Their Appl., 2009 Reversed Dickson polynomials over finite fields are obtained from Dickson polynomials Dn(x,a) over finite fields by reversing the roles of the indeterminate x and the parameter a. We study reversed Dickson polynomials with emphasis on their permutational
Xiang-dong Hou +3 more
semanticscholar +2 more sources
Further results on permutation polynomials and complete permutation polynomials over finite fields
AIMS Mathematics, 2021 In this paper, by employing the AGW criterion and determining the number of solutions to some equations over finite fields, we further investigate nine classes of permutation polynomials over $ \mathbb{F}_{p^n} $ with the form $ (x^{p^m}-x+\delta)^{s_1}+(
Qian Liu +3 more
semanticscholar +1 more source
R-fat Linearized Polynomials over Finite Fields [PDF]
Journal of Combinatorial Theory, 2020 In this paper we prove that the property of being scattered for a $\mathbb{F}_q$-linearized polynomial of small $q$-degree over a finite field $\mathbb{F}_{q^n}$ is unstable, in the sense that, whenever the corresponding linear set has at least one point
D. Bartoli +3 more
semanticscholar +1 more source
Uniform estimates for smooth polynomials over finite fields
Discrete Analysis, 2023 Uniform estimates for smooth polynomials over finite fields, Discrete Analysis 2023:16, 31 pp. A positive integer $n$ is called $m$-_smooth_ if its largest prime factor has size at most $m$.
Ofir Gorodetsky
doaj +1 more source
On inverses of some permutation polynomials over finite fields of characteristic three [PDF]
Finite Fields Their Appl., 2019 By using the piecewise method, Lagrange interpolation formula and Lucas' theorem, we determine explicit expressions of the inverses of a class of reversed Dickson permutation polynomials and some classes of generalized cyclotomic mapping permutation ...
Yanbin Zheng +3 more
semanticscholar +1 more source
On the number of factorizations of polynomials over finite fields [PDF]
Journal of Combinatorial Theory, Series A, 2020 Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree at most n over F.
Rachel N. Berman, Ron M. Roth
openaire +2 more sources
On Some Computational and Applications of Finite Fields
Ratio Mathematica, 2020 Finite field is a wide topic in mathematics. Consequently, none can talk about the whole contents of finite fields. That is why this research focuses on small content of finite fields such as polynomials computational, ring of integers modulo p where p ...
Jean Pierre Muhirwa
doaj +1 more source