Results 21 to 30 of about 8,727,877 (287)
Finite-element models of microelectrode field potentials in the eye.
, 2002 Finite-element models of microelectrode field potentials in the ...
Robert Washington. LeAnder (7996376)
core +4 more sources
Lower Bound of the Complexity of Seven-Valued Functions in the Class of Polarized Polynomials
Известия Иркутского государственного университета: Серия "Математика", 2017 One of the directions of the investigation of functions over finite fields is the study of their representations, including polynomial ones. In the area of polynomial representations of functions the problem of estimating the complexity of such ...
A.S. Baliuk, A.S. Zinchenko
doaj +1 more source
Elements of high order in finite fields specified by binomials
Karpatsʹkì Matematičnì Publìkacìï, 2022 Let $F_q$ be a field with $q$ elements, where $q$ is a power of a prime number $p\geq 5$. For any integer $m\geq 2$ and $a\in F_q^*$ such that the polynomial $x^m-a$ is irreducible in $F_q[x]$, we combine two different methods to explicitly construct ...
V. Bovdi, A. Diene, R. Popovych
doaj +1 more source
The complexity of pseudo-Kronecker and free-Kronecker forms of functions over finite fields
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 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
On multiplication in finite fields
Journal of Complexity, 2010 The authors introduce complexity notions and give a brief review of algebraic fields. They propose a method for multiplication in finite fields. The method is shown to be a significant improvement over the best known bilinear complexities for certain finite fields.
Murat Cenk, Ferruh Özbudak
openaire +3 more sources
Field Simulation as an Aid to Machine Design: The State of the Art [PDF]
, 2006 The paper provides an overview of the modern field simulation techniques available to assist in the design and performance prediction of electromechanical devices, including electric motors. Commercial software, usually based on finite element or related
Jan Sykulski +2 more
core +2 more sources
Computation with finite fields
Information and Control, 1963 A technique for systematically generating representations of finite fields is presented. Relations which must be physically realized in order to implement a parallel arithmetic unit to add, multiply, and divide elements of finite fields of 2n elements are obtained.
Thomas C. Bartee, David I. Schneider
openaire +1 more source
On the multiplicative order of elements in Wiedemann's towers of finite fields
Karpatsʹkì Matematičnì Publìkacìï, 2015 We consider recursive binary finite field extensions $E_{i+1} =E_{i} (x_{i+1} )$, $i\ge -1$, defined by D. Wiedemann. The main object of the paper is to give some proper divisors of the Fermat numbers $N_{i} $ that are not equal to the multiplicative ...
R. Popovych
doaj +1 more source
Proceedings of the American Mathematical Society, 1962 Let \(F^*\) be the multiplicative group of non-zero elements of \(\mathrm{GF}(p^n)\) where \(p\) is a prime; set \(p^n-1 = rs\) where \((r, s) = 1\), \(r < s\) and \(r\not\equiv 1 \bmod p\). \(F^*\) has subgroups \(Y, Z\) of orders \(r, s\) respectively and every element \(\xi\) of \(F^*\) can be expressed uniquely in the form \(\xi = \eta\zeta\) with \
openaire +2 more sources
Some Multisecret-Sharing Schemes over Finite Fields
Mathematics, 2020 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