Skip to search formSkip to main contentSkip to account menu

Hamming distance

Known as: Hamming cube, Minimum Hamming distance, Substitution distance 
In information theory, the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
We present the Word Mover's Distance (WMD), a novel distance function between text documents. Our work is based on recent results… 
Highly Cited
2012
Highly Cited
2012
Motivated by large-scale multimedia applications we propose to learn mappings from high-dimensional data to binary codes that… 
Highly Cited
2011
Highly Cited
2011
In the gap Hamming distance problem, two parties must determine whether their respective strings x; y2f0; 1g n are at Hamming… 
Highly Cited
2010
Highly Cited
2010
We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied gap-hamming-distance… 
Highly Cited
2009
Highly Cited
2009
In information theory and computer science, the Levenshtein distance is a metric for measuring the amount of difference between… 
Highly Cited
2005
Highly Cited
2005
We introduce a new type of Identity-Based Encryption (IBE) scheme that we call Fuzzy Identity-Based Encryption. In Fuzzy IBE we… 
Highly Cited
2004
Highly Cited
2004
Many problems in information retrieval and related fields depend on a reliable measure of the distance or similarity between… 
Highly Cited
2003
Highly Cited
2003
We provide formal definitions and efficient secure techniques for turning biometric information into keys usable for any… 
Highly Cited
2003
Highly Cited
2003
Biometrics-based personal identification is regarded as an effective method for automatically recognizing, with a high confidence… 
Highly Cited
2000
Highly Cited
2000
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…