Results 61 to 70 of about 1,833,915 (185)

Finite field-dependent symmetries in perturbative quantum gravity

, 2013
In this paper we discuss the absolutely anticommuting nilpotent symmetries for perturbative quantum gravity in general curved spacetime in linear and non-linear gauges.
Upadhyay, Sudhaker
core   +1 more source

On Matrix Representation of Extension Field GF(p^L) and Its Application in Vector Linear Network Coding

Entropy
For a finite field GF(pL) with prime p and L>1, one of the standard representations is L×L matrices over GF(p) so that the arithmetic of GF(pL) can be realized by the arithmetic among these matrices over GF(p). Based on the matrix representation of GF(pL)
Hanqi Tang, Heping Liu, Sheng Jin, Wenli Liu, Qifu Sun   +4 more
doaj   +1 more source

Ranked solutions of the matric equation A1X1=A2X2

International Journal of Mathematics and Mathematical Sciences, 1980
Let GF(pz) denote the finite field of pz elements. Let A1 be s×m of rank r1 and A2 be s×n of rank r2 with elements from GF(pz). In this paper, formulas are given for finding the number of X1,X2 over GF(pz) which satisfy the matric equation A1X1=A2X2 ...
A. Duane Porter, Nick Mousouris
doaj   +1 more source

Optimal quinary cyclic codes with minimum distance four

Tongxin xuebao, 2017
Cyclic codes are an extremely important subclass of linear codes.They are widely used in the communication systems and data storage systems because they have efficient encoding and decoding algorithm.Until now,how to construct the optimal ternary cyclic ...
Ye TIAN, Yu-qing ZHANG, Yu-pu HU
doaj  

Elements of high order in Artin-Shreier extensions of finite fields(in Ukrainian) [PDF]

Математичні Студії, 2013
We construct explicitly in any finite field of the form $F_{p^p}$ elements with multiplicative order larger than $4^p$.
R. B. Popovych
doaj  

On fundamental sets over a finite field

International Journal of Mathematics and Mathematical Sciences, 1985
A partition over finite field is defined and each equivalence class is constructed and represented by a set called the fundamental set. If a primitive element is used to construct the addition table over these fundamental sets then all additions over the
Yousef Abbas, Joseph J. Liang
doaj   +1 more source

Point Compression and Coordinate Recovery for Edwards Curves over Finite Field

Annals of the West University of Timisoara: Mathematics and Computer Science, 2014
We present two computational approaches for the purpose of point compression and decompression on Edwards curves over the finite field Fp where p is an odd prime.
Justus Benjamin
doaj   +1 more source

New Constructions of Complete Permutation Polynomials over Finite Fields of Even Characteristic

Mathematics
Complete permutation polynomials have many applications in mathematics and cryptography. In this paper, we study the complete permutation property of polynomial xh(xq−1)q+1 over Fq2, where h(x)=h1(x+xq)+h2(x+xq)xk.
Jian Li, Zhengbang Zha, Ziran Tu
doaj   +1 more source

Probabilistic Algorithms in Finite Fields [PDF]

SIAM Journal on Computing, 1980
We present probabilistic algorithms for the problems of finding an irreducible polynomial of degree n over a finite field, finding roots of a polynomial, and factoring a polynomial into its irreducible factors over a finite field. All of these problems are of importance in algebraic coding theory, algebraic symbol manipulation, and number theory. These
openaire   +2 more sources

An adaptive cryptosystem on a Finite Field. [PDF]

PeerJ Comput Sci, 2021
Bhowmik A, Menon U.
europepmc   +1 more source