Sciweavers

1400 search results - page 58 / 280
» On multiplication in finite fields
Sort
View
ICALP
2000
Springer
14 years 12 days ago
Generating Partial and Multiple Transversals of a Hypergraph
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
DCC
2007
IEEE
14 years 8 months ago
Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials
In this contribution, we derive a novel parallel formulation of the standard Itoh-Tsujii algorithm for multiplicative inverse computation over GF(2m). The main building blocks use...
Francisco Rodríguez-Henríquez, Guillermo Morales...
APAL
2000
90views more  APAL 2000»
13 years 8 months ago
The definable multiplicity property and generic automorphisms
Let T be a strongly minimal theory with quantifier elimination. We show that the class of existentially closed models of T {" is an automorphism"} is an elementary clas...
Hirotaka Kikyo, Anand Pillay
DCC
2007
IEEE
14 years 8 months ago
Multiple Description Coding for Stationary and Ergodic Sources
We consider the problem of multiple description (MD) coding for stationary sources with the squared error distortion measure. The MD rate region is derived for the stationary and ...
Jun Chen, Chao Tian, Suhas N. Diggavi
TC
2008
13 years 8 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...