Примеры использования Finite field на Английском языке и их переводы на Русский язык
{-}
-
Colloquial
-
Official
A finite field F is not algebraically closed.
I have to factor a univariate polynomial over a finite field.
Thus, the finite field of order q, Fq, has no square root of -1.
It forms a vector space over the two-element finite field.
The proof examines the set of elements a in the finite field of order pq such that a and 2-a both have norm 1.
In particular, he could take their points with values in any finite field.
The set of polynomials over a finite field with the operations of addition and multiplication forms an infinite polynomial ring F q{\textstyle\mathbf{F}_{q.
This provides a bound on the number of points on a curve over a finite field.
Add a new element, call it∞,to the 11 elements of the finite field F11 that is, the integers mod 11.
The code can also be constructed as the quadratic residue code of length 11 over the finite field F3.
One can similarly construct projective planes over any other finite field, with the Fano plane being the smallest.
More narrowly, a Galois geometry may be defined as a projective space over a finite field.
The problem was that the cohomology of a coherent sheaf over a finite field couldn't capture as much topology as singular cohomology with integer coefficients.
A specialized form of Learning with errors operates within the ring of polynomials over a finite field.
He found that if a finite field of characteristic 2 also has an automorphism whose square was the Frobenius map, then an analogue of Steinberg's construction gave the Suzuki groups.
Informally, these are the groups that resemble rank 1 groups of Lie type over a finite field of characteristic 2.
Pre-multiplying it with y-1 and then taking the inverse,Bob gets K. In the original formulation of this protocol the group used was the group of invertible matrices over a finite field.
F 2{\displaystyle F_{2}\,}- The set of univariate polynomials with coefficients in the finite field F 2{\displaystyle F_{2}\,} of cardinality 2.
For the encryption functions used in the Shamir algorithm and the Massey-Omura algorithm described above,the security relies on the difficulty of computing discrete logarithms in a finite field.
In the RLWE context the coefficients of the polynomials and all operations involving those coefficients will be done in a finite field, typically the field Z/ q Z F q{\textstyle\mathbf{Z}/q\mathbf{Z}=\mathbf{F}_{q}} for a prime integer q{\textstyle q.
We prove that the local field of positive characteristic is a vector space over a finite field.
Segre's theorem states that in a Galois geometryof odd order(that is, a projective plane defined over a finite field of odd characteristic) every oval is a conic.
The ring learning with errors(RLWE)problem is built on the arithmetic of polynomials with coefficients from a finite field.
These problems are the difficulty of factoring the product of two carefully chosen prime numbers,the difficulty to compute discrete logarithms in a carefully chosen finite field, and the difficulty of computing discrete logarithms in a carefully chosen elliptic curve group.
Gaussian binomial coefficients also play an important role in the enumerative theory of projective spaces defined over a finite field.
The general linear group GL(2, 7)consists of all invertible 2×2 matrices over F7, the finite field with 7 elements.
There is also an important action of Q8 on the eight nonzero elements of the 2-dimensional vector space over the finite field F3.
The Fano plane can be constructed via linear algebra as the projective plane over the finite field with two elements.
In this case the group of fixed points is also the group of points of a twisted(quasisplit)form of X defined over a finite field.
Segre was a pioneer in finite geometry,in particular projective geometry based on vector spaces over a finite field.