Results 41 to 50 of about 127,631 (176)
Finding roots of polynomials over finite fields
, 2006 We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.Comment: 6 pages ...
Fedorenko, Sergei V., Trifonov, Piter V.
core +1 more source
Fixed Points of the Dickson Polynomials of the Second Kind
Journal of Applied Mathematics, 2013 The permutation behavior of Dickson polynomials of the first kind has been extensively studied, while such behavior for Dickson polynomials of the second kind is less known.
Adama Diene, Mohamed A. Salim
doaj +1 more source
Real-World Applications of a Newly Designed Root-Finding Algorithm and Its Polynomiography
IEEE Access, 2021 Solving non-linear equations in different scientific disciplines is one of the most important and frequently appearing problems. A variety of real-world problems in different scientific fields can be modeled via non-linear equations. Iterative algorithms
Amir Naseem +2 more
doaj +1 more source
Factoring Dickson Polynomials over Finite Fields
Finite Fields and Their Applications, 1999 The authors provide shorter and more elementary proofs, than those previously given, of certain factorizations of Dickson (and bivariate Dickson) polynomials over a finite field.
Bhargava, Manjul, Zieve, Michael E.
openaire +2 more sources
A New Construction of Multisender Authentication Codes from Polynomials over Finite Fields
Journal of Applied Mathematics, 2013 Multisender authentication codes allow a group of senders to construct an authenticated message for a receiver such that the receiver can verify the authenticity of the received message.
Xiuli Wang
doaj +1 more source
Settled polynomials over finite fields [PDF]
Proceedings of the American Mathematical Society, 2011 We study the factorization into irreducibles of iterates of a quadratic polynomial f f over a finite field. We call f f settled when the factorization of its n n th iterate for large n n is dominated by “stable” polynomials, namely those that are irreducible under post-composition ...
Jones, Rafe, Boston, Nigel
openaire +2 more sources
Symmetric polynomials over finite fields
Finite Fields and Their Applications, 2023 v2: minor ...
Mátyás Domokos, Botond Miklósi
openaire +4 more sources
Gauss factorials of polynomials over finite fields
, 2017 In this paper we initiate a study on Gauss factorials of polynomials over finite fields, which are the analogues of Gauss factorials of positive integers.Comment: 17 ...
Li, Xiumei, Sha, Min
core +1 more source
On flux integrals for generalized Melvin solution related to simple finite-dimensional Lie algebra
European Physical Journal C: Particles and Fields, 2017 A generalized Melvin solution for an arbitrary simple finite-dimensional Lie algebra $$\mathcal G$$ G is considered. The solution contains a metric, n Abelian 2-forms and n scalar fields, where n is the rank of $$\mathcal G$$ G .
V. D. Ivashchuk
doaj +1 more source
Evaluation of Some Sums of Polynomials in Fq[t]
Journal of Applied Mathematics, 2019 We prove the polynomial analogues of some Liouville identities from elementary number theory. Consequently several sums defined over the finite fields Fq[t] are evaluated by combining the results obtained and some of the results from sums of reciprocals ...
Adama Diene
doaj +1 more source