Results 31 to 40 of about 12,890,521 (357)
Galois LCD codes over finite fields [PDF]
In this paper, we study the complementary dual codes in more general setting (which are called Galois LCD codes) by a uniform method. A necessary and sufficient condition for linear codes to be Galois LCD codes is determined, and constacyclic codes to be
Xiusheng Liu, Yun Fan, Hualu Liu
semanticscholar +1 more source
A Note on Powers in Finite Fields [PDF]
The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research.
Aabrandt, Andreas +1 more
core +2 more sources
The Applications of Algebraic Polynomial Rings in Satellite Coding and Cryptography [PDF]
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
Scattering amplitudes over finite fields and multivariate functional reconstruction [PDF]
A bstractSeveral problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their ...
T. Peraro
semanticscholar +1 more source
Matrix powers over finite fields
Let GF(q) denote the finite field of order q=pe with p odd. Let M denote the ring of 2×2 matrices with entries in GF(q). Let n denote a divisor of q−1 and assume 2≤n and 4 does not divide n.
Maria T. Acosta-De-Orozco +1 more
doaj +1 more source
Advances in QED with intense background fields [PDF]
Upcoming and planned experiments combining increasingly intense lasers and energetic particle beams will access new regimes of nonlinear, relativistic, quantum effects.
A. Fedotov +6 more
semanticscholar +1 more source
The radical factors of f(x)−f(y) over finite fields
Let F denote the finite field of order q For f(x) in F[x], let f*(x,y) denote the substitution polynomial f(x)−f(y). The polynomial f*(x,y) has frequently been used in questions on the values set of f(x) In this paper we consider the irreducible factors ...
Javier Gomez-Calderon
doaj +1 more source
Finite fields and cryptology [PDF]
The problem of a computationally feasible method of finding the discrete logarithm in a (large) finite field is discussed, presenting the main algorithms in this direction.
Ennio Cortellini
doaj
On permutation polynomials over finite fields
A polynomial f over a finite field F is called a permutation polynomial if the mapping F→F defined by f is one-to-one. In this paper we consider the problem of characterizing permutation polynomials; that is, we seek conditions on the coefficients of a ...
R. A. Mollin, C. Small
doaj +1 more source
A note on inverses of cyclotomic mapping permutation polynomials over finite fields [PDF]
In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula of inverses of generalized cyclotomic permutation polynomials over finite fields.
Qiang Wang
semanticscholar +1 more source

