Results 21 to 30 of about 11,891,302 (357)
New constructions of SD and MR codes over small finite fields [PDF]
International Symposium on Information Theory, 2016 Data storage applications require erasure-correcting codes with prescribed sets of dependencies between data symbols and redundant symbols. The most common arrangement is to have k data symbols and h redundant symbols (that each depends on all data ...
Guangda Hu, S. Yekhanin
semanticscholar +1 more source
Matrix powers over finite fields
International Journal of Mathematics and Mathematical Sciences, 1992 Let GF(q) denote the finite field of order q=pe with p odd. Let M denote the ring of 2×2 matrices with entries in GF(q). Let n denote a divisor of q−1 and assume 2≤n and 4 does not divide n.
Maria T. Acosta-De-Orozco +1 more
doaj +1 more source
Hamming distance from irreducible polynomials over $\mathbb {F}_2$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 We study the Hamming distance from polynomials to classes of polynomials that share certain properties of irreducible polynomials. The results give insight into whether or not irreducible polynomials can be effectively modeled by these more general ...
Gilbert Lee +2 more
doaj +1 more source
Del Pezzo surfaces over finite fields and their Frobenius traces [PDF]
Mathematical Proceedings of the Cambridge Philosophical Society, 2016 Let S be a smooth cubic surface over a finite field $\mathbb{F}$q. It is known that #S($\mathbb{F}$q) = 1 + aq + q2 for some a ∈ {−2, −1, 0, 1, 2, 3, 4, 5, 7}. Serre has asked which values of a can arise for a given q.
Barinder S. Banwait +2 more
semanticscholar +1 more source
The radical factors of f(x)−f(y) over finite fields
International Journal of Mathematics and Mathematical Sciences, 1997 Let F denote the finite field of order q For f(x) in F[x], let f*(x,y) denote the substitution polynomial f(x)−f(y). The polynomial f*(x,y) has frequently been used in questions on the values set of f(x) In this paper we consider the irreducible factors ...
Javier Gomez-Calderon
doaj +1 more source
Finite fields and cryptology [PDF]
Computer Science Journal of Moldova, 2003 The problem of a computationally feasible method of finding the discrete logarithm in a (large) finite field is discussed, presenting the main algorithms in this direction.
Ennio Cortellini
doaj
On permutation polynomials over finite fields
International Journal of Mathematics and Mathematical Sciences, 1987 A polynomial f over a finite field F is called a permutation polynomial if the mapping F→F defined by f is one-to-one. In this paper we consider the problem of characterizing permutation polynomials; that is, we seek conditions on the coefficients of a ...
R. A. Mollin, C. Small
doaj +1 more source
The existence of $\protect \mathbb{F}_q$-primitive points on curves using freeness
Comptes Rendus. Mathématique, 2022 Let $\mathcal{C}_Q$ be the cyclic group of order $Q$, $n$ a divisor of $Q$ and $r$ a divisor of $Q/n$. We introduce the set of $(r,n)$-free elements of $\mathcal{C}_Q$ and derive a lower bound for the number of elements $\theta \in \mathbb{F}_q$ for ...
Cohen, Stephen D. +2 more
doaj +1 more source
Strict avalanche criterion over finite fields
Journal of Mathematical Cryptology, 2007 Boolean functions which satisfy the Strict Avalanche Criterion (SAC) play an important role in the art of information security. In this paper, we extend the concept of SAC to finite fields GF(p).
Li Yuan, Cusick T. W.
doaj +1 more source
Ternary number systems in finite fields [PDF]
Компьютерная оптика, 2018 The work continues the author's previous study of positional number systems in finite fields. The paper considers ternary number systems and arithmetic operations algorithms for the representation of elements of finite fields in the so-called ternary ...
Vladimir Chernov
doaj +1 more source