Incomplete character sums and a special class of permutations

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

doi:10.5802/jtnb.303

Incomplete character sums and a special class of permutations

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

School of Computing

Research output: Contribution to journal › Article › peer-review

9 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	53-63
Number of pages	11
Journal	Journal de Theorie des Nombres de Bordeaux
Volume	13
Issue number	1
DOIs	https://doi.org/10.5802/jtnb.303
Publication status	Published - 2001

Access to Document

10.5802/jtnb.303

Cite this

@article{65bf6449479542b78fea4dd1364ea00d,

title = "Incomplete character sums and a special class of permutations",

abstract = "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.",

author = "Cohen, {S. D.} and H. Niederreiter and Shparlinski, {I. E.} and M. Zieve",

year = "2001",

doi = "10.5802/jtnb.303",

language = "English",

volume = "13",

pages = "53--63",

journal = "Journal de Theorie des Nombres de Bordeaux",

issn = "1246-7405",

publisher = "Universite de Bordeaux I, Centre de Recherces en Mathematiques",

number = "1",

}

TY - JOUR

T1 - Incomplete character sums and a special class of permutations

AU - Cohen, S. D.

AU - Niederreiter, H.

AU - Shparlinski, I. E.

AU - Zieve, M.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85009909919&partnerID=8YFLogxK

U2 - 10.5802/jtnb.303

DO - 10.5802/jtnb.303

M3 - Article

AN - SCOPUS:85009909919

SN - 1246-7405

VL - 13

SP - 53

EP - 63

JO - Journal de Theorie des Nombres de Bordeaux

JF - Journal de Theorie des Nombres de Bordeaux

IS - 1

ER -

Incomplete character sums and a special class of permutations

Abstract

Access to Document

Other files and links

Fingerprint

Cite this