Bounds For Binary Codes Relative To Pseudo-distances Of K Points | 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.

Bounds For Binary Codes Relative To Pseudo-distances Of K Points

Bachoc Christine Imb, Zemor Gilles Imb. Arxiv 2010

[Paper]    
ARXIV

We apply Schrijver’s semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.

Similar Work