Sciweavers

1400 search results - page 16 / 280
» On multiplication in finite fields
Sort
View
TC
1998
13 years 7 months ago
A New Representation of Elements of Finite Fields GF(2m) Yielding Small Complexity Arithmetic Circuits
—Let F2 denote the binary field and F 2 m an algebraic extension of degree m > 1 over F2 . Traditionally, elements of F 2 m are either represented as powers of a primitive ele...
Germain Drolet
CISS
2008
IEEE
14 years 1 months ago
Costas array generator polynomials in finite fields
—Permutations of order N are generated using polynomials in a Galois field GF(q) where q > N+1, which can be written as a linear transformation on a vector of polynomial coeff...
James K. Beard
COCO
2008
Springer
79views Algorithms» more  COCO 2008»
13 years 9 months ago
Towards Dimension Expanders over Finite Fields
In this paper we study the problem of explicitly constructing a dimension expander raised by [BISW04]: Let Fn be the n dimensional linear space over the field F. Find a small (ide...
Zeev Dvir, Amir Shpilka
EMNLP
2009
13 years 5 months ago
Graphical Models over Multiple Strings
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
Markus Dreyer, Jason Eisner
DCC
2008
IEEE
14 years 7 months ago
On the graph of a function in many variables over a finite field
Some improved bounds on the number of directions not determined by a point set in the affine space AG(k, q) are presented. More precisely, if there are more than pe (q -1) directio...
Simeon Ball