Results 221 to 230 of about 176,578 (264)
Some of the next articles are maybe not open access.
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
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
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
A Sárközy Theorem for Finite Fields
Combinatorics, Probability and Computing, 2003A classical result of Sárközy states that, for any and any positive density subset E of , there exist elements x and y of E and such that . A version of this result for finite fields is derived from a recent theorem of P. Larick, a short proof of which is also given.
openaire +1 more source
Unknown finite fields as to the boolean finite fields theory
Journal of Discrete Mathematical Sciences and Cryptography, 2014AbstractThis note presents a canonical construction of the structures of modal Θ -valent field ( mΘf) and modal Θ -valent pseudo field (mΘpf) as defined by F. Ayissi Eteme in (9). Their respective sets of the invertibles and modal Θ -invertibles are modal Θ -valent groups ( mΘg).
openaire +1 more source
A combined finite element–finite volume framework for phase-field fracture
Computer Methods in Applied Mechanics and Engineering, 2021Inga Berre +2 more
exaly
Interval field model and interval finite element analysis
Computer Methods in Applied Mechanics and Engineering, 2020Chao Jiang, B Y Ni
exaly
Investigating propagation path of interface crack by the field-enriched finite element method
Applied Mathematical Modelling, 2021Xiao-Ping Zhou
exaly