Login / Signup

Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound.

Can XiangCunsheng DingSihem Mesnager
Published in: IEEE Trans. Inf. Theory (2015)
Keyphrases
  • hamming distance
  • binary codes
  • worst case
  • lower bound
  • vector quantization
  • hash functions
  • data structure
  • training set
  • efficient similarity search
  • neural network
  • object recognition
  • dynamic programming
  • hamming space