Combinatorics and Finite Fields: Difference Sets, Polynomials, Pseudorandomness and Applications (Radon on Computational and Applied Mathematics)

✍ Scribed by Kai-Uwe Schmidt (editor)

• Publisher: De Gruyter
• Year: 2019
• Tongue: English
• Leaves: 326
• Series: Radon on Computational and Applied Mathematics (Book 23)
• Category: Library

✦ Synopsis

Combinatorics and finite fields are of great importance in modern applications such as in the analysis of algorithms, in information and communication theory, and in signal processing and coding theory. This book contains survey articles on topics s

✦ Table of Contents

Cover
Radon Series on Computational
and Applied Mathematics
Combinatorics and
Finite Fields: Difference Sets, Polynomials, Pseudorandomness and
Applications
© 2019
Introduction
Contents
1 Tiling rings with “precious” differences
2 q-analogs of group divisible designs
3 A survey on bent functions and their duals
4 Construction of Bent functions using
covering extended building sets
5 Results on permutation polynomials of
shape xt + γTrqn/q(xd)
6 A new structure for difference matrices over
abelian p-groups
7 Weil sums of binomials: properties,
applications and open problems
8 A survey on iterations of mappings over
finite fields
9 Cyclotomy, difference sets, sequences with
low correlation, strongly regular graphs and
related geometric substructures
10 Pseudorandomness of large sets in finite
fields
11 Point-plane incidences and some
applications in positive characteristic
12 A survey of group invariant Butson matrices
and their relation to generalized bent
functions and various other objects
14 Differential fault attack on hardware stream
ciphers—a technical survey
15