Results 211 to 220 of about 89,096 (260)
Systematic comparison of inverse Langevin function approximations in stochastic dumbbell dynamics. [PDF]
J Nonnewton Fluid MechCromer M, Vasquez PA.
europepmc +1 more source
A Fast Prediction Method for Wide-Angle Bistatic Scattering and Reflection Coefficients of Acoustically Coated Plates. [PDF]
Sensors (Basel)Zhang Y, Peng Z, Tan L, Wu S, Lv E.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
52nd IEEE Conference on Decision and Control, 2013
This work studies consensus networks over finite fields, where agents process and communicate values from the set of integers {0,..., p-1}, for some prime number p, and operations are performed modulo p. For consensus networks over finite fields we provide necessary and sufficient conditions on the network topology and weights to ensure convergence ...
Fabio Pasqualetti +2 more
openaire +2 more sources
This work studies consensus networks over finite fields, where agents process and communicate values from the set of integers {0,..., p-1}, for some prime number p, and operations are performed modulo p. For consensus networks over finite fields we provide necessary and sufficient conditions on the network topology and weights to ensure convergence ...
Fabio Pasqualetti +2 more
openaire +2 more sources
On involutions of finite fields
2015 IEEE International Symposium on Information Theory (ISIT), 2015In this paper we study involutions over a finite field of order $\bf 2^n$. We present some classes, several constructions of involutions andwe study the set of their fixed points.
Charpin, Pascale +2 more
openaire +2 more sources
On the finite field Nullstellensatz [PDF]
Australas. J Comb., 2000 Let \(\mathbb{P}^n\) be the \(n\)-dimensional projective space defined over an algebraically closed field of positive characteristic \(p\), let \(q\) be a power of \(p\) and let \(X\) be an irreducible closed \(\mathbb{F}_q\)-definable subvariety of \(\mathbb{P}^n\) (here \(\mathbb{F}_q\) denotes the Galois field of \(q\) elements).
E. BALLICO, COSSIDENTE, Antonio
openaire +1 more source
1981 IEEE 5th Symposium on Computer Arithmetic (ARITH), 1981
The arithmetic operations in finite fields and their implementation are important to the construction of error detecting and correcting codes. The addition, multiplication and division in the field GF(2m) are implemented as polynomial operations using binary logic of flip-flops and EXOR's.
openaire +1 more source
The arithmetic operations in finite fields and their implementation are important to the construction of error detecting and correcting codes. The addition, multiplication and division in the field GF(2m) are implemented as polynomial operations using binary logic of flip-flops and EXOR's.
openaire +1 more source