Back to Search
Start Over
Optimal Hash Functions for Approximate Matches on the n-Cube.
- Source :
-
IEEE Transactions on Information Theory . Mar2010, Vol. 56 Issue 3, p984-991. 8p. 5 Charts, 1 Graph. - Publication Year :
- 2010
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 56
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 48683737
- Full Text :
- https://doi.org/10.1109/TIT.2009.2039037