Results 11 to 20 of about 479 (179)
Advanced Engineering Research, 2018 Introduction. Polynomials in several variables over Galois fields provide the basis for the Reed-Muller coding theory, and are also used in a number of cryptographic problems.
V. M. Deundyak, N. S. Mogilevskaya
doaj +1 more source
QUANTUM THEORY AND GALOIS FIELDS [PDF]
International Journal of Modern Physics B, 2006 We discuss the motivation and main results of a quantum theory over a Galois field (GFQT). The goal of the paper is to describe main ideas of GFQT in a simplest possible way and to give clear and simple arguments that GFQT is a more natural quantum theory than the standard one.
openaire +2 more sources
GALOIS FIELD QUANTUM MECHANICS [PDF]
Modern Physics Letters B, 2013 We construct a discrete quantum mechanics (QM) using a vector space over the Galois field GF(q). We find that the correlations in our model do not violate the Clauser–Horne–Shimony–Holt (CHSH) version of Bell's inequality, despite the fact that the predictions of this discrete QM cannot be reproduced with any hidden variable theory.
Chang, Lay Nam +3 more
openaire +3 more sources
Infinite Towers of Galois Defect Extensions of Kaplansky Fields
Annales Mathematicae Silesianae, 2018 We give conditions for Kaplansky fields to admit infinite towers of Galois defect extensions of prime degree. As proofs of the presented facts are constructive, this provides examples of constructions of infinite towers of Galois defect extensions of ...
Blaszczok Anna
doaj +1 more source
Implementation of Galois Field for Application in Wireless Communication Channels
MATEC Web of Conferences, 2018 This paper discusses the implementation of Galois Field based codes for application in wireless communication channel. It discusses the use of Galois Fields outlining the basic performance of a digital communication system in terms of BER curves.
Sarma Dikshita +3 more
doaj +1 more source
Efficiency of sequence synthesis methods with the «not more than one coincidence» property
Tekhnologiya i Konstruirovanie v Elektronnoi Apparature, 2016 The author presents an expression for determining the minimum possible length of binary sequences with "not more than one coincidence" property. Obtained low bound length value allows quantitatively estimating efficiency of any known synthesis methods ...
A. I. Nevrev, O. N. Galchenkov
doaj +1 more source
COMPUTING IMAGES OF GALOIS REPRESENTATIONS ATTACHED TO ELLIPTIC CURVES
Forum of Mathematics, Sigma, 2016 Let $E$ be an elliptic curve without complex multiplication (CM) over a number field $K$
ANDREW V. SUTHERLAND
doaj +1 more source
On finite arithmetic groups [PDF]
International Journal of Group Theory, 2013 Let $F$ be a finite extension of $Bbb Q$, ${Bbb Q}_p$ or a globalfield of positive characteristic, and let $E/F$ be a Galois extension.We study the realization fields offinite subgroups $G$ of $GL_n(E)$ stable under the naturaloperation of the Galois ...
Dmitry Malinin
doaj
Transactions of the London Mathematical Society, 2019 Recently, there has been much interest in studying the torsion subgroups of elliptic curves base‐extended to infinite extensions of Q. In this paper, given a finite group G, we study what happens with the torsion of an elliptic curve E over Q when ...
Harris B. Daniels +2 more
doaj +1 more source
Designing a Block Cipher in Galois Extension Fields for IoT Security
IoT, 2021 This paper focuses on a block cipher adaptation of the Galois Extension Fields (GEF) combination technique for PRNGs and targets application in the Internet of Things (IoT) space, an area where the combination technique was concluded as a quality stream ...
Kiernan George, Alan J. Michaels
doaj +1 more source