Results 181 to 190 of about 1,050,138 (224)
Advanced Materials, EarlyView.Residual magnetization induces pronounced mechanical anisotropy in ultra‐soft magnetorheological elastomers, shaping deformation and actuation even without external magnetic fields. This study introduces a computational‐experimental framework integrating magneto‐mechanical coupling into topology optimization for designing soft magnetic actuators with ...
Carlos Perez‐Garcia +3 more
wiley +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 the finite field Nullstellensatz [PDF]
Australas. J Comb., 2020 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
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
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
Information Processing Letters, 1982
Let \(p\) be a fixed prime and \(n=m_1m_2\cdots m_l\) be a factorization of a positive integer \(n\) such that \(m_1\ge m_2\ge \ldots\ge m_l\ge 1\). The author proposes an algorithm for realizing the finite field \(\mathrm{GF}(p^n)\) with \(p^n\) elements, by the chain of field extensions \[ \mathrm{GF}(p)\subseteq \mathrm{GF}(p^{m_1})\subseteq \mathrm{
openaire +1 more source
Let \(p\) be a fixed prime and \(n=m_1m_2\cdots m_l\) be a factorization of a positive integer \(n\) such that \(m_1\ge m_2\ge \ldots\ge m_l\ge 1\). The author proposes an algorithm for realizing the finite field \(\mathrm{GF}(p^n)\) with \(p^n\) elements, by the chain of field extensions \[ \mathrm{GF}(p)\subseteq \mathrm{GF}(p^{m_1})\subseteq \mathrm{
openaire +1 more source
Classification of Finite Fields with Applications
Journal of Automated Reasoning, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hing-Lun Chan, Michael Norrish
openaire +1 more source
1998
Abstract We shall show in this chapter that for each prime p and positive integer n there is one and only one field with pn elements. This field is sometimes called the Galois field of order pn and is denoted by GF(pn). We shall prove the existence of GF(pn) by showing that there is an irreducible polynomial of degree n over the field
A W Chatters, C R Hajarnavis
openaire +1 more source
Abstract We shall show in this chapter that for each prime p and positive integer n there is one and only one field with pn elements. This field is sometimes called the Galois field of order pn and is denoted by GF(pn). We shall prove the existence of GF(pn) by showing that there is an irreducible polynomial of degree n over the field
A W Chatters, C R Hajarnavis
openaire +1 more source