Linear Programming Bounds for Almost-Balanced Binary Codes.
Venkatesan GuruswamiAndrii RiazanovPublished in: ISIT (2021)
Keyphrases
- binary codes
- linear programming
- hamming distance
- efficient similarity search
- hamming space
- linear program
- lower bound
- similarity search
- locality sensitive hashing
- optimal solution
- dynamic programming
- np hard
- objective function
- locality sensitive
- image collections
- hash functions
- high dimensional data
- database
- hashing methods
- machine learning
- edit distance
- low dimensional
- object recognition
- data structure
- database systems