Discrete Lunch‎ > ‎

Linear programming and permutation codes

posted Dec 12, 2014, 6:53 AM by Dirk Oliver Theis   [ updated Dec 12, 2014, 6:54 AM ]
On Mon Dec 15, Ago-Erik will talk about another Coding Theory related topic, this time it is connected to association schemes, coherent configurations, and linear programming. (Ago will explain all these words.) Via these connections, linear programming can be used to give bounds on sizes of codes based on permutations. Ago will base his presentation partly on this paper by Lim and Hagiwara.