Results 21 to 30 of about 464 (180)
Efficiency of sequence synthesis methods with the «not more than one coincidence» property
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
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]
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
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
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
Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles
ABSTRACT The ability to reliably explain why a machine learning model arrives at a particular prediction is crucial when used as decision support by human operators of critical systems. The provided explanations must be provably correct, and preferably without redundant information, called minimal explanations.
John Törnblom +2 more
wiley +1 more source
Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley +1 more source
Ordinary primes for GL2$\operatorname{GL}_2$‐type abelian varieties and weight 2 modular forms
Abstract Let A$A$ be a g$g$‐dimensional abelian variety defined over a number field F$F$. It is conjectured that the set of ordinary primes of A$A$ over F$F$ has positive density, and this is known to be true when g=1,2$g=1, 2$, or for certain abelian varieties with extra endomorphisms.
Tian Wang, Pengcheng Zhang
wiley +1 more source
Attribute Implication Bases From Galois Connection Structures
ABSTRACT Modeling knowledge systems by determining relationships among key variables have been and currently is a fundamental and nontrivial challenge in real‐world scenarios. Many approaches have been developed to reach this goal, but many of them are heuristic and require of alternative procedures to provide robust and tractable rules.
M. Eugenia Cornejo +2 more
wiley +1 more source
MODULAR SYSTOLIC DIGITAL SIGNAL PROCESSOR WITH RECONFIGURING THE STRUCTURE
Computational systolic model for orthogonal signal transformation in extended Galois GF(pv) fields based on polynomial system of residue classes is examined. Modular codes' ability to increase fault-tolerant characteristics is proven.
Igor Anatol’evich Kalmykov +3 more
doaj

