Symbolic Computation Group

David R. Cheriton School of Computer Science
University of Waterloo, Waterloo, Ontario, Canada

PAF/NPAF, string sorting and an open problem in Orthogonal Designs
Ilias Kotsireas, Wilfrid Laurier University
Friday, October 12, 2007, at U. of Western Ontario.

Abstract:

The concepts of the periodic and non-periodic autocorrelation functions (abbreviated as PAF and NPAF respectively) are of central importance in Combinatorial Design Theory. We will explain these concepts in detail and then we will describe two algorithms that can be used to search for sequences with PAF/NPAF zero. We will finish by presenting an open problem in Orthogonal Designs, namely that there is an OD(128;8_{16}), and describe how this problem can be tackled using Groebner bases.

 

Last modified on Sunday, 04 November 2012, at 20:42 hours.