Incomplete character sums and a special class of permutations

S. D. Cohen, H. Niederreiter, I. E. Shparlinski, M. Zieve

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)


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 R-orthomorphism. Examples of R-orthomorphisms are given.

Original languageEnglish
Pages (from-to)53-63
Number of pages11
JournalJournal de Theorie des Nombres de Bordeaux
Issue number1
Publication statusPublished - 2001


Dive into the research topics of 'Incomplete character sums and a special class of permutations'. Together they form a unique fingerprint.

Cite this