Time: 2018-7-8 10：00-11：00

Venue: Room 201 Lecture Hall

abstract：

Ahlswede and Katona posed the following average distance problem: Determine the minimum average Hamming distanceβ(n, M) of binary codes with length n and size M. We present some improved lower bounds forβ(n, M) with the help of linear programming in coding theory. As a corollary, some exact values ofβ(n, M) are determined.