eBook ISBN:  9781470422202 
Product Code:  CONM/632.E 
List Price:  $125.00 
MAA Member Price:  $112.50 
AMS Member Price:  $100.00 
eBook ISBN:  9781470422202 
Product Code:  CONM/632.E 
List Price:  $125.00 
MAA Member Price:  $112.50 
AMS Member Price:  $100.00 

Book DetailsContemporary MathematicsVolume: 632; 2015; 371 ppMSC: Primary 05; 11; 12; 20; 51; 94
This volume contains the proceedings of the 11th International Conference on Finite Fields and their Applications (Fq11), held July 22–26, 2013, in Magdeburg, Germany.
Finite Fields are fundamental structures in mathematics. They lead to interesting deep problems in number theory, play a major role in combinatorics and finite geometry, and have a vast amount of applications in computer science.
Papers in this volume cover these aspects of finite fields as well as applications in coding theory and cryptography.
ReadershipGraduate students and research mathematicians interested in number theory, coding theory, cryptography, and finite geometry.

Table of Contents

Articles

Sergey Abrahamyan and Melsik Kyureghyan — New recursive construction of normal polynomials over finite fields

A. Aguglia and G. Korchmáros — Collineation groups strongly irreducible on an oval in a projective plane of odd order

Ioulia N. Baoulina — On the solvability of certain equations over finite fields

Martino Borello — On automorphism groups of binary linear codes

Anne Canteaut and Joëlle Roué — Extended differential properties of cryptographic functions

Florian Caullery — A divisibility criterion for exceptional APN functions

Ayça Çeşmelioğlu and Wilfried Meidl — Non weakly regular bent polynomials from vectorial quadratic functions

A. Cossidente, G. Korchmáros and G. Marino — Strongly regular graphs arising from Hermitian varieties

Jérôme Ducoat — Generalized rank weights: A duality statement

Satoru Fukasawa — An upper bound for the number of Galois points for a plane curve

Rainer Göttfert — A generalization of the nonlinear combination generator

Yoshinori Hamahata — Dedekind sums with a parameter in function fields

Masaaki Homma — Numbers of points of hypersurfaces without lines over finite fields

Thomas Honold, Michael Kiermaier and Sascha Kurz — Optimal binary subspace codes of length $6$, constant dimension $3$ and minimum subspace distance $4$

Xiangdong Hou — A survey of permutation binomials and trinomials over finite fields

MingDeh Huang and Anand Kumar Narayanan — Computing class groups of function fields using stark units

MingDeh Huang and Anand Kumar Narayanan — Finding primitive elements in finite fields of small characteristic

Relinde Jurrius and Ruud Pellikaan — The coset leader and list weight enumerator

Nicholas M. Katz — Wieferich past and future

Michel Lavrauw and Geertrui Van de Voorde — Field reduction and linear sets in finite geometry

Sihem Mesnager — Bent functions from spreads

Amela MuratovićRibić, Alexander Pott, David Thomson and Qiang Wang — On the characterization of a semimultiplicative analogue of planar functions over finite fields

Mikhail Muzychuk — A solution of an equivalence problem for semisimple cyclic codes

Johannes Mykkeltveit and Janusz Szmidt — On cross joining de Bruijn sequences

Daniel Panario, Amin Sakzad and David Thomson — Ambiguity and deficiency of reversed Dickson permutations

J. Wolfmann — From nearbent to bent: A special case


Additional Material

RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Additional Material
 Requests
This volume contains the proceedings of the 11th International Conference on Finite Fields and their Applications (Fq11), held July 22–26, 2013, in Magdeburg, Germany.
Finite Fields are fundamental structures in mathematics. They lead to interesting deep problems in number theory, play a major role in combinatorics and finite geometry, and have a vast amount of applications in computer science.
Papers in this volume cover these aspects of finite fields as well as applications in coding theory and cryptography.
Graduate students and research mathematicians interested in number theory, coding theory, cryptography, and finite geometry.

Articles

Sergey Abrahamyan and Melsik Kyureghyan — New recursive construction of normal polynomials over finite fields

A. Aguglia and G. Korchmáros — Collineation groups strongly irreducible on an oval in a projective plane of odd order

Ioulia N. Baoulina — On the solvability of certain equations over finite fields

Martino Borello — On automorphism groups of binary linear codes

Anne Canteaut and Joëlle Roué — Extended differential properties of cryptographic functions

Florian Caullery — A divisibility criterion for exceptional APN functions

Ayça Çeşmelioğlu and Wilfried Meidl — Non weakly regular bent polynomials from vectorial quadratic functions

A. Cossidente, G. Korchmáros and G. Marino — Strongly regular graphs arising from Hermitian varieties

Jérôme Ducoat — Generalized rank weights: A duality statement

Satoru Fukasawa — An upper bound for the number of Galois points for a plane curve

Rainer Göttfert — A generalization of the nonlinear combination generator

Yoshinori Hamahata — Dedekind sums with a parameter in function fields

Masaaki Homma — Numbers of points of hypersurfaces without lines over finite fields

Thomas Honold, Michael Kiermaier and Sascha Kurz — Optimal binary subspace codes of length $6$, constant dimension $3$ and minimum subspace distance $4$

Xiangdong Hou — A survey of permutation binomials and trinomials over finite fields

MingDeh Huang and Anand Kumar Narayanan — Computing class groups of function fields using stark units

MingDeh Huang and Anand Kumar Narayanan — Finding primitive elements in finite fields of small characteristic

Relinde Jurrius and Ruud Pellikaan — The coset leader and list weight enumerator

Nicholas M. Katz — Wieferich past and future

Michel Lavrauw and Geertrui Van de Voorde — Field reduction and linear sets in finite geometry

Sihem Mesnager — Bent functions from spreads

Amela MuratovićRibić, Alexander Pott, David Thomson and Qiang Wang — On the characterization of a semimultiplicative analogue of planar functions over finite fields

Mikhail Muzychuk — A solution of an equivalence problem for semisimple cyclic codes

Johannes Mykkeltveit and Janusz Szmidt — On cross joining de Bruijn sequences

Daniel Panario, Amin Sakzad and David Thomson — Ambiguity and deficiency of reversed Dickson permutations

J. Wolfmann — From nearbent to bent: A special case