Lower bounds on the minimum average distance of binary codes
arXiv:0706.3295
Abstract
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.
19 pages
arXiv:0706.3295
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.
19 pages