Sciweavers

1400 search results - page 29 / 280
» On multiplication in finite fields
Sort
View
AAECC
1993
Springer
170views Algorithms» more  AAECC 1993»
13 years 11 months ago
Exponential Sums as Discrete Fourier Transform with Invariant Phase Functions
We give estimates for exponential sums over finite fields in several variables. We study the case where the phase is either quadratic or more generally invariant under the action ...
Gilles Lachaud
JSC
2006
81views more  JSC 2006»
13 years 7 months ago
A database of local fields
We describe our online database of finite extensions of Qp, and how it can be used to facilitate local analysis of number fields.
John W. Jones, David P. Roberts
3DPVT
2004
IEEE
116views Visualization» more  3DPVT 2004»
13 years 11 months ago
Real-Time, Accurate Depth of Field using Anisotropic Diffusion and Programmable Graphics Cards
Computer graphics cameras lack the finite Depth of Field (DOF) present in real world ones. This results in all objects being rendered sharp regardless of their depth, reducing the...
Marcelo Bertalmío, Pere Fort, Daniel S&aacu...
MOC
2002
84views more  MOC 2002»
13 years 7 months ago
Smooth ideals in hyperelliptic function fields
Recently, several algorithms have been suggested for solving the discrete logarithm problem in the Jacobians of high-genus hyperelliptic curves over finite fields. Some of them hav...
Andreas Enge, Andreas Stein
FFA
2006
69views more  FFA 2006»
13 years 7 months ago
Information sets and partial permutation decoding for codes from finite geometries
We determine information sets for the generalized Reed-Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also ...
Jennifer D. Key, T. P. McDonough, Vassili C. Mavro...