Sciweavers

73 search results - page 12 / 15
» Permutations, hyperplanes and polynomials over finite fields
Sort
View
AUTOMATICA
2002
95views more  AUTOMATICA 2002»
13 years 7 months ago
Series expansions for analytic systems linear in control
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
Francesco Bullo
ASIACRYPT
2006
Springer
13 years 11 months ago
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe...
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 8 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
FFA
2008
42views more  FFA 2008»
13 years 7 months ago
Weyl sums in Fq[x] with digital restrictions
Let Fq be a finite field and consider the polynomial ring Fq[X]. Let Q Fq[X]. A function f : Fq[X] G, where G is a group, is called strongly Q-additive, if f(AQ + B) = f(A) + f(B...
Manfred G. Madritsch, Jörg M. Thuswaldner
DCC
2010
IEEE
13 years 2 months ago
Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
Nathan Drake, Gretchen L. Matthews