Results 21 to 30 of about 8,379,944 (285)
Some Multisecret-Sharing Schemes over Finite Fields
Mathematics, 2020 A secret sharing scheme is a method of assigning shares for a secret to some participants such that only some distinguished subsets of these subsets can recover the secret while other subsets cannot.
Selda Çalkavur, Patrick Solé
doaj +1 more source
Counting Quiver Representations over Finite Fields Via Graph Enumeration [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Let $\Gamma$ be a quiver on $n$ vertices $v_1, v_2, \ldots , v_n$ with $g_{ij}$ edges between $v_i$ and $v_j$, and let $\boldsymbol{\alpha} \in \mathbb{N}^n$.
Geir Helleloid +1 more
doaj +1 more source
A theorem about linear rank inequalities that depend on the characteristic of the finite field
Selecciones Matemáticas, 2022 A linear rank inequality is a linear inequality that holds by dimensions of vector spaces over any finite field. A characteristic-dependent linear rank inequality is also a linear inequality that involves dimensions of vector spaces but this holds over ...
Victor Peña-Macias
doaj +1 more source
Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields
Open Mathematics, 2020 In 2006, Hubert, Mauduit and Sárközy extended the notion of binary sequences to n-dimensional binary lattices and introduced the measures of pseudorandomness of binary lattices.
Chen Xiaolin
doaj +1 more source
On multiplication in finite fields
Journal of Complexity, 2010 The authors introduce complexity notions and give a brief review of algebraic fields. They propose a method for multiplication in finite fields. The method is shown to be a significant improvement over the best known bilinear complexities for certain finite fields.
Murat Cenk, Ferruh Özbudak
openaire +3 more sources
Computation with finite fields
Information and Control, 1963 A technique for systematically generating representations of finite fields is presented. Relations which must be physically realized in order to implement a parallel arithmetic unit to add, multiply, and divide elements of finite fields of 2n elements are obtained.
Thomas C. Bartee, David I. Schneider
openaire +1 more source
Proceedings of the American Mathematical Society, 1962 Let \(F^*\) be the multiplicative group of non-zero elements of \(\mathrm{GF}(p^n)\) where \(p\) is a prime; set \(p^n-1 = rs\) where \((r, s) = 1\), \(r < s\) and \(r\not\equiv 1 \bmod p\). \(F^*\) has subgroups \(Y, Z\) of orders \(r, s\) respectively and every element \(\xi\) of \(F^*\) can be expressed uniquely in the form \(\xi = \eta\zeta\) with \
openaire +2 more sources
Practical analysis of 3-D dynamic nonlinear magnetic field using time-periodic finite element method [PDF]
, 1995 A practical 3-D finite element method using edge elements for analyzing stationary nonlinear magnetic fields with eddy currents in electric apparatus, in which the flux interlinking the voltage winding is given, has been proposed.
Nakata, Takayoshi +5 more
core +1 more source
Arithmetic in a finite field [PDF]
Mathematics of Computation, 1980 An algorithm for realizing finite field arithmetic is presented. The relationship between linear recursions and polynomial arithmetic (modulo a fixed polynomial) over Zp is exploited to reduce the storage and computation requirements of the algorithm.
openaire +1 more source
The Hartley transform in a finite field [PDF]
ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202), 1999 7 pages, IEEE/SBT International Telecommunication Symposium, ITS, 1998, Sao Paulo ...
Ricardo M. Campello de Souza +2 more
openaire +4 more sources