Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 206,221,211 papers from all fields of science
Search
Sign In
Create Free Account
Hamming distance
Known as:
Hamming cube
, Minimum Hamming distance
, Substitution distance
Expand
In information theory, the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
50 relations
Admissible heuristic
Belief revision
Biometrics
Bitwise operation
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
From Word Embeddings To Document Distances
Matt J. Kusner
,
Yu Sun
,
Nicholas I. Kolkin
,
Kilian Q. Weinberger
ICML
2015
Corpus ID: 14674248
We present the Word Mover's Distance (WMD), a novel distance function between text documents. Our work is based on recent results…
Expand
Highly Cited
2012
Highly Cited
2012
Hamming Distance Metric Learning
Mohammad Norouzi
,
David J. Fleet
,
R. Salakhutdinov
NIPS
2012
Corpus ID: 8180104
Motivated by large-scale multimedia applications we propose to learn mappings from high-dimensional data to binary codes that…
Expand
Highly Cited
2011
Highly Cited
2011
The Communication Complexity of Gap Hamming Distance
Alexander A. Sherstov
Theory Comput.
2011
Corpus ID: 5375553
In the gap Hamming distance problem, two parties must determine whether their respective strings x; y2f0; 1g n are at Hamming…
Expand
Highly Cited
2010
Highly Cited
2010
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
A. Chakrabarti
,
O. Regev
SIAM J. Comput.
2010
Corpus ID: 2123455
We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied gap-hamming-distance…
Expand
Highly Cited
2009
Highly Cited
2009
Levenshtein Distance: Information theory, Computer science, String (computer science), String metric, Damerau?Levenshtein distance, Spell checker, Hamming distance
Frederic P. Miller
,
A. Vandome
,
John McBrewster
2009
Corpus ID: 64130157
In information theory and computer science, the Levenshtein distance is a metric for measuring the amount of difference between…
Expand
Highly Cited
2005
Highly Cited
2005
Fuzzy Identity-Based Encryption
A. Sahai
,
Brent Waters
EUROCRYPT
2005
Corpus ID: 10137076
We introduce a new type of Identity-Based Encryption (IBE) scheme that we call Fuzzy Identity-Based Encryption. In Fuzzy IBE we…
Expand
Highly Cited
2004
Highly Cited
2004
Generalized Hamming Distance
A. Bookstein
,
V. Kulyukin
,
T. Raita
Information Retrieval
2004
Corpus ID: 10156047
Many problems in information retrieval and related fields depend on a reliable measure of the distance or similarity between…
Expand
Highly Cited
2003
Highly Cited
2003
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Y. Dodis
,
R. Ostrovsky
,
Leonid Reyzin
,
Adam D. Smith
SIAM J. Comput.
2003
Corpus ID: 2095658
We provide formal definitions and efficient secure techniques for turning biometric information into keys usable for any…
Expand
Highly Cited
2003
Highly Cited
2003
Online Palmprint Identification
David Zhang
,
A. Kong
,
J. You
,
Michael Wong
IEEE Trans. Pattern Anal. Mach. Intell.
2003
Corpus ID: 16210072
Biometrics-based personal identification is regarded as an effective method for automatically recognizing, with a high confidence…
Expand
Highly Cited
2000
Highly Cited
2000
On the Hamming distance of linear codes over a finite chain ring
G. Norton
,
A. Sălăgean
IEEE Trans. Inf. Theory
2000
Corpus ID: 8231543
Let R be a finite chain ring (e.g., a Galois ring), K its residue field, and C a linear code over R. We prove that d(C), the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE