Lower bounds on the minimum average distance of binary codes

New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.Comment: 19 page