Login / Signup
A new upper bound for binary codes with minimum distance four.
Jun Kyo Kim
Sang Geun Hahn
Published in:
Discret. Math. (1998)
Keyphrases
</>
minimum distance
upper bound
binary codes
hamming distance
lower bound
hamming space
similarity search
locality sensitive hashing
image collections
convex polyhedra
hash functions
hashing methods
high dimensional data
high dimensional
pattern matching
low dimensional
low level
similarity measure