SPEAKERS
Stephen Cohen, University of Glasgow
Theo Garefalakis, University of Crete
Guang Gong, University of Waterloo
Gary McGuire, Claude Shannon Institute/UniversityCollege
Dublin
Gary Mullen, Pennsylvania State University
Arne Winterhof, Austrian Academy of Sciences
Qing Xiang, University of Delaware
Joe Yucas, Southern Illinois University
OVERVIEW
The meeting is a focused workshop on specific current research areas
of finite fields. The areas being discussed are: (1) pseudorandom
sequences, (2) permutation polynomials and other functions over
finite fields, (3) irreducible and primitive polynomials over finite
fields. Each topic will have an attached 3-hour mini-course or invited
talks (or both), which aim to present the state of the art as well
as explain the techniques used in current research and open problems
within each topic.
To supplement the mini-courses and the invited talks, we will be
accepting a small number of half-hour contributed talks on current
research in finite fields. Free access to rooms with blackboards
and computer access will be available.
The meeting will begin on the morning of Tuesday July 20 and continue
through the afternoon of Friday July 23. Registration is free and
space is limited, therefore we recommend registering as early as
possible.
IMPORTANT DATES
Deadline for registering: Tuesday June 30, 2010
Deadline for contributed talks: Tuesday June 1, 2010
Workshop: Tuesday July 20 - Friday July 23, 2010
SCHEDULE
|
Tuesday, July 20
|
| 10:00-11:00 |
Arne Winterhof (Austrian Academy of Sciences)
Mini-course on pseudorandom Sequences
Part I: Linear Complexity and Related Complexity Measures |
| 11:00-11:15 |
Coffee break |
| 11:15-12:15 |
Guang Gong (University of Waterloo)
Multi-valued Sequences with 2-Level Autocorrelation from
Iterative Decimation Hadamard Transform |
| 12:15-2:00 |
Lunch Break |
| 2:00-3:00 |
Qing Xiang (University of Delaware)
Strongly Regular Cayley Graphs: Constructions and Problems |
| 3:00-3:30 |
Coffee Break |
| 3:30-4:00 |
Amir Akbary-Majdabadno (University of Lethbridge)
On permutation polynomials of prescribed shape |
| 4:00-4:30 |
Jing He (Carleton University)
A Family of Binary Sequences from Interleaved Construction
and
their Cryptographic Properties |
| 4:30-5:00 |
Frédéric A. B. Edoukou
(Nanyang Technological University)
Number of points in the intersection of two quadrics defined
over
finite fields |
|
Wednesday, July 21
|
| 10:00-11:00 |
Arne Winterhof (Austrian Academy of Sciences)
Mini-course on pseudorandom Sequences
Part II: Exponential Sums and Uniform Distribution |
| 11:00-11:15 |
Coffee Break |
| 11:15-12:15 |
Gary Mullen (Pennsylvania State
University)
How are irreducible and primitive polynomials distributed
over finite fields? |
| 12:15-2:00 |
Lunch Break |
| 2:00-3:00 |
Stephen Cohen (University of Glasgow)
Methods for primitive and normal polynomials |
| 3:00-3:15 |
Coffee Break |
| 3:15-4:15 |
Stephen Cohen (University of Glasgow)
Methods for primitive and normal polynomials |
| 4:15-4:45 |
Georgios Tzanakis (Carleton University)
On a generalization of the Hansen-Mullen Conjecture for irreducible
polynomials with a fixed coefficient |
|
Thursday, July 22
|
| 10:00-11:00 |
Arne Winterhof (Austrian Academy
of Sciences)
Mini-course on pseudorandom Sequences
Part III: Measures of Pseudorandomness for Binary and Quaternary
Sequences |
| 11:00-11:15 |
Coffee Break |
| 11:15-12:15 |
Gary McGuire (University College
Dublin)
Computing Fourier Spectra |
| 12:15-2:00 |
Lunch Break |
| 2:00-3:00 |
Theo Garefalakis (University
of Crete)
Self-reciprocal irreducible polynomials with prescribed coefficients |
| 3:00-3:30 |
Coffee Break |
| 3:30-4:00 |
Behzad Omidi Koma (Carleton University)
The Number of Irreducible Polynomials of Even Degree n over
F2 with Four Given Coefficients |
| 4:00-4:30 |
Kseniya Garaschuk (University of Victoria)
Highly nonlinear functions and exponential sums |
| 4:30-5:00 |
Amir Sakzad (Amirkabir University of Technology)
Self-Inverse Interleavers for Turbo Codes |
|
Friday, July 23
|
| 10:00-11:00 |
Gary Mullen (Pennsylvania State University)
Some basic results concerning permutation polynomials over
finite fields |
| 11:00-11:15 |
Coffee break |
| 11:15-12:15 |
Joe Yucas (University of Southern Illinois
Carbondale)
Dickson Polynomials over Finite Fields |
| 12:15-12:45 |
John Sheekey (University College Dublin)
On the roots of a polynomial connected with Golomb Costas
Arrays |
|
End of Workshop
|
SPEAKER PRESENTATIONS
Amir Akbary-Majdabadno, University of Lethbridge
On permutation polynomials of prescribed
shape
Stephen Cohen, University of Glasgow
Methods for primitive and normal polynomials
Frédéric Edoukou, Nanyang Technological University
Number of points in the intersection
of two quadrics defined over
finite fields
Kseniya Garaschuk, University of Victoria
Highly nonlinear functions
and exponential sums
Guang Gong, University of Waterloo
Multi-valued Sequences with 2-Level Autocorrelation
from Iterative Decimation Hadamard Transform
Jing He, Carleton University
A Family of Binary Sequences from Interleaved
Construction and their Cryptographic Properties
Behzad Omidi Koma, Carleton University
The Number of Irreducible Polynomials
of Even Degree n over F2 with Four Given Coefficients
Gary Mullen, Pennsylvania State University
How are irreducible and primitive
polynomials distributed over finite fields?
Some basic results concerning
permutation polynomials over finite fields
Amir Sakzad, Amirkabir University of Technology
Self-Inverse Interleavers for Turbo
Codes
John Sheekey, University College Dublin
On the roots of a polynomial connected
with Golomb Costas Arrays
Georgios Tzanakis, Carleton University
On a generalization of the Hansen-Mullen
Conjecture for irreducible polynomials with a fixed coefficient
Arne Winterhof, Austrian Academy of Sciences
Part I
Part II
Part III
Qing Xiang, University of Delaware
Strongly Regular Cayley Graphs: Constructions
and Problems
----
If you have any questions or to register, please send any inquiries
to the organizers at finitefields@math.carleton.ca
Top
