On the number of solutions of two-variable diagonal quartic equations over finite fields
Let $p$ be a odd prime number and let $\mathbb{F}_q$ be the finite field of characteristic $p$ with $q$ elements. In this paper, by using the Gauss sum and Jacobi sum, we give an explicit formula for the number $N(x_1^4+x_2^4=c)$ of solutions of the ...
Junyong Zhao, Yang Zhao, Yujun Niu
doaj +1 more source
Longitudinal static optical properties of hydrogen chains: finite field extrapolations of matrix product state calculations. [PDF]
We have implemented the sweep algorithm for the variational optimization of SU(2) U(1) (spin and particle number) invariant matrix product states (MPS) for general spin and particle number invariant fermionic Hamiltonians.
S. Wouters +3 more
semanticscholar +1 more source
The recurrence formula for the number of solutions of a equation in finite field
The main purpose of this paper is using analytic methods to give a recurrence formula of the number of solutions of an equation over finite field. We use analytic methods to give a recurrence formula for the number of solutions of the above equation. And
Yanbo Song
doaj +1 more source
The complexity of pseudo-Kronecker and free-Kronecker forms of functions over finite fields
An approach enabling partial generalization of the Green–Sasao hierarchy for polynomial forms of Boolean functions to the case of an arbitrary finite field was introduced.
A.S. Baliuk
doaj +1 more source
Mayfly optimistic hyperelliptic curve cryptosystem
Various applications use asymmetric cryptography to secure communications between both parties, and it raises the main issue of generating vast amounts of computation and storage.
Ramireddy Nava Teja Reddy +7 more
doaj +1 more source
Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields
In 2006, Hubert, Mauduit and Sárközy extended the notion of binary sequences to n-dimensional binary lattices and introduced the measures of pseudorandomness of binary lattices.
Chen Xiaolin
doaj +1 more source
Some Multisecret-Sharing Schemes over Finite Fields
A secret sharing scheme is a method of assigning shares for a secret to some participants such that only some distinguished subsets of these subsets can recover the secret while other subsets cannot.
Selda Çalkavur, Patrick Solé
doaj +1 more source
The number of rational points on a class of hypersurfaces in quadratic extensions of finite fields
Let $ q $ be an even prime power and let $ \mathbb{F}_{q} $ be the finite field of $ q $ elements. Let $ f $ be a nonzero polynomial over $ \mathbb{F}_{q^2} $ of the form $ f = a_{1}x_{1}^{m_{1}}+\dots+a_{s}x_{s}^{m_{s}}+y_{1}y_{2}+\dots+y_{n-1}y_{n}+y_ ...
Qinlong Chen , Wei Cao
doaj +1 more source
Computing character degrees via a Galois connection [PDF]
In a previous paper, the second author established that, given finite fields ...
Mark L. Lewis , John K. McVey
doaj
On the Orders of the Elements of a Square Extension of a Finite Field of Characteristic 2
Let F(2m) will be an arbitrary finite field of characteristic 2. It’s square extension will be considered as an algebra with basiс elements 1 and e over the field F(2m).
Valery Maximov, Victoria Remezova
doaj +1 more source

