Referenced Items are not available for this document.
Optimal Hash Functions for Approximate Matches on the 
-Cube
Optimal Hash Functions for Approximate Matches on the
One way to find near-matches in large datasets is to use hash functions. In recent years locality-sensitive hash functions for various metrics have been given; for the Hamming metric projecting onto k bits is simple hash function that performs well. In this paper, we investigate alternatives to projection. For various parameters hash functions given by complete decoding algorithms for error-correcting codes work better, and asymptotically random codes perform better than projection.
Published in:
Information Theory, IEEE Transactions on
(Volume:56
,
Issue:
3
)
Date of Publication: March 2010
- Page(s):
- 984 - 991
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 11171698
- Digital Object Identifier :
- 10.1109/TIT.2009.2039037
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 11 March 2010
- Issue Date :
- March 2010
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
