Sciweavers

561 search results - page 15 / 113
» Using number fields to compute logarithms in finite fields
Sort
View
TEC
2008
93views more  TEC 2008»
13 years 8 months ago
An Artificial Immune System Heuristic for Generating Short Addition Chains
This paper deals with the optimal computation of finite field exponentiation, which is a well-studied problem with many important applications in the areas of error-correcting code...
Nareli Cruz Cortés, Francisco Rodríg...
VIS
2007
IEEE
108views Visualization» more  VIS 2007»
14 years 9 months ago
Efficient Visualization of Lagrangian Coherent Structures by Filtered AMR Ridge Extraction
This paper presents a method for filtered ridge extraction based on adaptive mesh refinement. It is applicable in situations where the underlying scalar field can be refined during...
Filip Sadlo, Ronald Peikert
FOCS
2010
IEEE
13 years 6 months ago
A Fourier-Analytic Approach to Reed-Muller Decoding
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
Parikshit Gopalan
COMBINATORICS
1999
83views more  COMBINATORICS 1999»
13 years 8 months ago
New Lower Bounds for Some Multicolored Ramsey Numbers
In this article we use two different methods to find new lower bounds for some multicolored Ramsey numbers. In the first part we use the finite field method used by Greenwood and ...
Aaron Robertson
MOC
2000
84views more  MOC 2000»
13 years 8 months ago
Solving Thue equations without the full unit group
Abstract. The main problem when solving a Thue equation is the computation of the unit group of a certain number field. In this paper we show that the knowledge of a subgroup of fi...
Guillaume Hanrot