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.
|Cornell University Library|
|arXiv.org e-Print archive|
|Organisation||Networks and Optimization|
Mounits, B. (2007). Lower bounds on the minimum average distance of binary codes. arXiv.org e-Print archive. Cornell University Library .