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… (More)
Wikipedia

Related topics

Related topics

50 relations
Admissible heuristicBelief revisionBiometricsBitwise operation
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The Information Complexity of Hamming Distance
The Hamming distance function Hamn,d returns 1 on all pairs of inputs x and y that di er in at most d coordinates and returns 0… (More)
Is this relevant?
2013
2013
Binary Code Ranking with Weighted Hamming Distance
Binary hashing has been widely used for efficient similarity search due to its query and storage efficiency. In most existing… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Hamming Distance Metric Learning
Motivated by large-scale multimedia applications we propose to learn mappings from high-dimensional data to binary codes that… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
Is this relevant?
Highly Cited
2012
Highly Cited
2012
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
We prove an optimal Ω(n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
The Communication Complexity of Gap Hamming Distance
In the gap Hamming distance problem, two parties must determine whether their respective strings x,y ∈ {0,1}n are at Hamming… (More)
  • figure 1
Is this relevant?
2011
2011
Large scale Hamming distance query processing
Hamming distance has been widely used in many application domains, such as near-duplicate detection and pattern recognition. We… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The One-Way Communication Complexity of Hamming Distance
Consider the following version of the Hamming distance problem for ±1 vectors of length n: the promise is that the distance is… (More)
Is this relevant?
2006
2006
The communication complexity of the Hamming distance problem
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the… (More)
Is this relevant?
2005
2005
Fuzzy Hamming Distance Based Banknote Validator
Banknote validation systems are used to discriminate between genuine and counterfeit banknotes. The paper proposes a one-class… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2005
2005
Competition of Languages and their Hamming Distance
We consider the spreading and competition of languages that are spoken by a population of individuals. The individuals can change… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?