A random construction for permutation codes and the covering radius
Fri, 02/29/2008 - 8:24pm — Webmaster
When
Start: 01/29/2008 - 11:15am
End : 01/29/2008 - 12:10pm
End : 01/29/2008 - 12:10pm
Category
Algebra/Number Theory/Combinatorics Seminar
Speaker
Cheng Yeaw Ku (California Institute of Technology)
Abstract
We analyse a probabilistic argument that gives a semi-random construction of a permutation code on n symbols with distance n-s, and a bound on the covering radius for sets of permutations in terms of a certain freuency parameter. This is joint work with Peter Keevash.
Where
Millikan 208, Pomona College