1400 search results - page 26 / 280 » On multiplication in finite fields |
141
click to vote
MOC
1998
15 years 1 months ago
1998
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...
115
click to vote
TIT
1998
15 years 1 months ago
1998
—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...
111
click to vote
FFA
2010
15 years 14 days ago
2010
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...
FFA
2010
15 years 14 days ago
2010
FFA
2010
15 years 14 days ago
2010