<p>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 such as difference sets, polynomials, and pseudor
Combinatorics and Finite Fields: Difference Sets, Polynomials, Pseudorandomness and Applications
β Scribed by Kai-Uwe Schmidt
- Publisher
- De Gruyter
- Year
- 2019
- Tongue
- English
- Leaves
- 326
- Series
- Radon on Computational and Applied Mathematics (Book 23)
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
This book contains survey articles based on some invited lectures of the workshop
Pseudo-Randomness and Finite Fields (October 15β19, 2018) of the RICAM Special
Semester on Multivariate Algorithms and their Foundations in Number Theory. This
workshop brought together some of the world-wide most prominent researchers in
the area of combinatorics and mnite melds and their applications.
Combinatorics and mnite melds are of great importance in modern applications
such as analysis of algorithms, information and communication theory, signal pro-
cessing and coding theory. This book contains 15 survey articles on topics such as
diο½erence sets, polynomials and pseudorandomness. For example, diο½erence sets are
intensively studied combinatorial objects with applications such as wireless commu-
nication and radar, imaging and quantum information theory. Polynomials appear
in check-digit systems and error-correcting codes. Pseudorandom structures guaran-
tee features needed for Monte-Carlo methods or cryptography. Additive combinatorics
over mnite melds has gained increasing interest in particular because of its applications
to computer science and coding theory.
β¦ Table of Contents
Cover......Page 1
Radon Series on Computational
and Applied Mathematics......Page 3
Combinatorics and
Finite Fields: Difference Sets, Polynomials, Pseudorandomness and
Applications
......Page 5
Β© 2019......Page 6
Introduction......Page 7
Contents
......Page 9
1 Tiling rings with βpreciousβ differences......Page 11
2 q-analogs of group divisible designs......Page 31
3 A survey on bent functions and their duals......Page 49
4 Construction of Bent functions using
covering extended building sets......Page 67
5 Results on permutation polynomials of
shape xt + Ξ³Trqn/q(xd)......Page 77
6 A new structure for difference matrices over
abelian p-groups......Page 89
7 Weil sums of binomials: properties,
applications and open problems......Page 119
8 A survey on iterations of mappings over
finite fields......Page 145
9 Cyclotomy, difference sets, sequences with
low correlation, strongly regular graphs and
related geometric substructures......Page 183
10 Pseudorandomness of large sets in finite
fields......Page 209
11 Point-plane incidences and some
applications in positive characteristic......Page 221
12 A survey of group invariant Butson matrices
and their relation to generalized bent
functions and various other objects......Page 251
14 Differential fault attack on hardware stream
ciphersβa technical survey......Page 265
15......Page 297
π SIMILAR VOLUMES
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
<p>This book is based on the invited talks of the "RICAM-Workshop on Finite Fields and Their Applications: Character Sums and Polynomials" held at the Federal Institute for Adult Education (BIfEB) in Strobl, Austria, from September 2-7, 2012.</p> <p>Finite fields play important roles in many applica
<span>This book uses finite field theory as a hook to introduce the reader to a range of ideas from algebra and number theory. It constructs all finite fields from scratch and shows that they are unique up to isomorphism. As a payoff, several combinatorial applications of finite fields are given: Si
Interest in combinatorial techniques has been greatly enhanced by the applications they may offer in connection with computer technology. The 38 papers in this volume survey the state of the art and report on recent results in Combinatorial Geometries and their applications.<p>Contributors: V. Abat
The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other a