Results 121 to 130 of about 464 (180)
Learning nonparametric ordinary differential equations from noisy data. [PDF]
J Comput PhysLahouel K +5 more
europepmc +1 more source
A High-Entropy True Random Number Generator with Keccak Conditioning for FPGA. [PDF]
Sensors (Basel)Piscopo V +4 more
europepmc +1 more source
Transcendental Brauer-Manin obstructions on singular K3 surfaces. [PDF]
Res Number TheoryAlaa Tawfik M, Newton R.
europepmc +1 more source
Hybrid Cuckoo Search-Bees Algorithm with Memristive Chaotic Initialization for Cryptographically Strong S-Box Generation. [PDF]
Biomimetics (Basel)Akyol S.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Galois extensions and $$O^{*}$$-fields
Positivity, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kenneth Evans, Jingjing Ma
openaire +1 more source
2015
A small portion of linear algebra and combinatorics are used in the development of Hamming codes, the first generation error control codes. The design of error control codes such as BCH codes and Reed Solomon codes relies on the structures of Galois fields and polynomials over Galois fields.
openaire +1 more source
A small portion of linear algebra and combinatorics are used in the development of Hamming codes, the first generation error control codes. The design of error control codes such as BCH codes and Reed Solomon codes relies on the structures of Galois fields and polynomials over Galois fields.
openaire +1 more source
1984
If F is an algebraic number field of degree n over Q and p is a prime, then F is p-realizable if there is a tor-sionfree abelian group A of rank n such that qA = A for all prines q i p and F is isomorphic to the quasi-endomorphism algebra of A. The question “for which F and p is F p-realizable?” was the subject of the paper by Pierce and Vinsonhaler ...
openaire +1 more source
If F is an algebraic number field of degree n over Q and p is a prime, then F is p-realizable if there is a tor-sionfree abelian group A of rank n such that qA = A for all prines q i p and F is isomorphic to the quasi-endomorphism algebra of A. The question “for which F and p is F p-realizable?” was the subject of the paper by Pierce and Vinsonhaler ...
openaire +1 more source
Reconfigurable Galois Field multiplier
2014 International Symposium on Biometrics and Security Technologies (ISBAST), 2014Galois Field has received a lot of attention because of their important and particular applications in cryptography, channel coding, etc. This paper presents the Reconfigurable Galois Field multiplier used to calculate the Galois field multiplication of different lengths which consists of AND gates and special cells.
Rong-Jian Chen +2 more
openaire +1 more source
HOPF–GALOIS STRUCTURES ON FIELD EXTENSIONS WITH SIMPLE GALOIS GROUPS
Bulletin of the London Mathematical Society, 2003Let \(L/K\) be a Galois extension of fields with Galois group \(G\). Then the group ring \(KG\) endows \(L/K\) with a Hopf Galois structure. There may be other \(K\)-Hopf algebras \(H\) endowing \(L/K\) with a Hopf Galois structure; all of them are forms of group rings over \(L\).
openaire +1 more source