Sciweavers

1400 search results - page 26 / 280
» On multiplication in finite fields
Sort
View
MOC
1998
97views more  MOC 1998»
13 years 7 months ago
Euclid's algorithm and the Lanczos method over finite fields
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...
Jeremy Teitelbaum
TIT
1998
78views more  TIT 1998»
13 years 7 months ago
Stationary Markov Random Fields on a Finite Rectangular Lattice
—This paper provides a complete characterization of stationary Markov random fields on a finite rectangular (nontoroidal) lattice in the basic case of a second-order neighborho...
Fréderic Champagnat, Jérôme Id...
FFA
2010
84views more  FFA 2010»
13 years 6 months ago
Generating series for irreducible polynomials over finite fields
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact for...
Arnaud Bodin
FFA
2010
81views more  FFA 2010»
13 years 6 months ago
Permutations, hyperplanes and polynomials over finite fields
András Gács, Tamás Hég...