1 paper
Beniamin Mounits
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.