Results 1 to 10 of about 12,115,560 (297)
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
Degree of orthomorphism polynomials over finite fields [PDF]
Finite Fields and Their Applications, 2021 An orthomorphism over a finite field $\mathbb{F}_q$ is a permutation $θ:\mathbb{F}_q\mapsto\mathbb{F}_q$ such that the map $x\mapstoθ(x)-x$ is also a permutation of $\mathbb{F}_q$. The degree of an orthomorphism of $\mathbb{F}_q$, that is, the degree of the associated reduced permutation polynomial, is known to be at most $q-3$. We show that this upper
Jack Allsop, Ian M. Wanless
openaire +4 more sources
Symmetric polynomials over finite fields
Finite Fields and Their Applications, 2023 v2: minor ...
Mátyás Domokos, Botond Miklósi
openaire +5 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
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 +3 more sources
On polynomial factorization over finite fields [PDF]
Mathematics of Computation, 1981 Let f ( x ) f(x)
Gunji, Hiroshi, Arnon, Dennis
openaire +1 more source
The Applications of Algebraic Polynomial Rings in Satellite Coding and Cryptography [PDF]
Mathematics Interdisciplinary Research, 2022 This survey illustrates and investigates the application of polynomial rings over finite fields to generate PRN codes for Global Navigation Satellite System (GNSS) satellites.
Amir Bagheri, Hassan Emami
doaj +1 more source
ORTHOGONAL SYSTEMS AND PERMUTATION POLYNOMIAL VECTORS OVER MODULAR ALGEBRAS
Revista de la Academia Colombiana de Ciencias Exactas, Físicas y Naturales, 2023 Known results on orthogonal systems and permutation polynomials vectors over finite fields are extended to modular algebras of the form Lν = K[X]/(p(X)ν ), where K is a finite field, p(X) ∈ K[X] is an irreducible polynomial, ν = 1, 2, . .
Victor Gonzalez
doaj +1 more source
On the Planarity of Certain Dembowski-Ostrom Polynomials
Süleyman Demirel Üniversitesi Fen-Edebiyat Fakültesi Fen Dergisi, 2022 Planar mappings, defined by Dembowski and Ostrom, are identified as a means to construct projective planes. Then, many important applications of planar mappings appear in different fields such as cryptography and coding theory.
Zehra Aksoy, Barış Bülent Kırlar
doaj +1 more source
A New Secret Sharing Scheme Based on Polynomials over Finite Fields
Mathematics, 2020 In this paper, we examine a secret sharing scheme based on polynomials over finite fields. In the presented scheme, the shares can be used for the reconstruction of the secret using polynomial multiplication. This scheme is both ideal and perfect.
Selda Çalkavur +2 more
doaj +1 more source