The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …

This book is an account of the combinatorics of projective spaces over a finite field, with
special emphasis on one and two dimensions. With its successor volumes, Finite projective …

On the size of a blocking set in <Emphasis Type="Italic">PG </Emphasis>(2, <Emphasis
Type="Italic& Page 1 COMBINATORICA Akad~miai Kiad6 - Springer-Verlag COMBINATORICA …

This book is mainly devoted to some computational and algorithmic problems in finite fields
such as, for example, polynomial factorization, finding irreducible and primitive polynomials …

In this paper we show that blocking sets of cardinality less than 3 (q+ 1)/2 (q= pn) in
Desarguesian projective planes intersect every line in 1 moduloppoints. It is also shown that …

A proof is presented that shows that the number of directions determined by a function over
a finite field GF (q) is either 1, at least (q+ 3)/2, or between q/s+ 1 and (q− 1)/(s− 1) for some s …

Methods for constructing large families of permutation polynomials of finite fields are
introduced. For some of these permutations the cycle structure and the inverse map** are …

D={u2&v2 u1&v1} u {v, u, v# U= K _ [] be the set of directions determined by the set U. Redei
[4] proves the following bounds for the size N of D: Either N (q+ 1) Ā2 or (q+ pe) Ā (pe+ 1) N …

A well-known conjecture due to van Lint and MacWilliams states that if A is a subset of F q 2
such that 0, 1∈ A,| A|= q, and a− b is a square for each a, b∈ A, then A must be the subfield …

We survey recent results concerning the size of blocking sets in desarguesian projective and
affine planes, and implications of these results and the technique to prove them, to related …