Improved discrepancy bounds for hybrid sequences involving Halton sequences
Incomplete character sums and a special class of permutations
We present a method of bounding incomplete character sums for finite abelian groups with arguments produced by a first-order recursion. This method is particularly effective if the recursion involves a special type of permutation called an -orthomorphism. Examples of -orthomorphisms are given.
Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
Irregularities of distribution of digital -sequences in prime base.