Lower Bounds On The Minimum Average Distance Of Binary Codes | Awesome Learning to Hash Add your paper to Learning2Hash

Awesome Learning to Hash

A Webpage dedicated to the latest research on Hash Function Learning. Maintained by Sean Moran.

Contact Sean Moran about this survey or website. Made with Jekyll and Hyde.

Lower Bounds On The Minimum Average Distance Of Binary Codes

Mounits Beniamin. Arxiv 2007

[Paper]    
ARXIV

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

Similar Work