Sciweavers

73 search results - page 2 / 15
» Permutations, hyperplanes and polynomials over finite fields
Sort
View
FFA
2006
69views more  FFA 2006»
13 years 6 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...
CORR
2010
Springer
166views Education» more  CORR 2010»
13 years 6 months ago
On Exponential Sums, Nowton identities and Dickson Polynomials over Finite Fields
Let Fq be a finite field, Fqs be an extension of Fq, let f(x) Fq[x]
Xiwang Cao, Lei Hu
DCC
2008
IEEE
14 years 5 months ago
On the graph of a function in many variables over a finite field
Some improved bounds on the number of directions not determined by a point set in the affine space AG(k, q) are presented. More precisely, if there are more than pe (q -1) directio...
Simeon Ball
STOC
1995
ACM
135views Algorithms» more  STOC 1995»
13 years 9 months ago
Subquadratic-time factoring of polynomials over finite fields
New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of
Erich Kaltofen, Victor Shoup