Sciweavers

33 search results - page 5 / 7
» ffa 2006
Sort
View
FFA
2010
84views more  FFA 2010»
13 years 6 months ago
Dembowski-Ostrom polynomials from Dickson polynomials
Motivated by several recent results, we determine precisely when Fk(Xd, a) − Fk(0, a) is a Dembowski-Ostrom polynomial, where Fk(X, a) is a Dickson polynomial of the first or se...
Robert S. Coulter, Rex W. Matthews
FFA
2010
84views more  FFA 2010»
13 years 6 months ago
Generating series for irreducible polynomials over finite fields
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...
Arnaud Bodin
FFA
2006
120views more  FFA 2006»
13 years 7 months ago
Enumerating permutation polynomials over finite fields by degree II
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal. First we extend the method of the previous paper proving an asymptotic formul...
Sergei Konyagin, Francesco Pappalardi
FFA
2006
77views more  FFA 2006»
13 years 7 months ago
Linear error-block codes
A linear error-block code is a natural generalization of the classical error-correcting code and has applications in experimental design, high-dimensional numerical integration an...
Keqin Feng, Lanju Xu, Fred J. Hickernell
FFA
2007
59views more  FFA 2007»
13 years 7 months ago
Error-correcting codes on low rank surfaces
In this paper we construct some algebraic geometric error-correcting codes on surfaces whose Neron-Severi group has low rank. If the rank of the Neron-Severi group is 1, the inters...
Marcos Zarzar