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 (opens in a new tab)

Related topics

Related topics

50 relations
Admissible heuristicBelief revisionBiometricsBitwise operation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Deep Cauchy Hashing for Hamming Space Retrieval
Due to its computation efficiency and retrieval quality, hashing has been widely applied to approximate nearest neighbor search… 
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… 
Highly Cited
2010
Highly Cited
2010
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… 
Highly Cited
2009
Highly Cited
2009
Levenshtein Distance: Information theory, Computer science, String (computer science), String metric, Damerau?Levenshtein distance, Spell checker, Hamming distance
In information theory and computer science, the Levenshtein distance is a metric for measuring the amount of difference between… 
Highly Cited
2009
Highly Cited
2009
Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds
Quasi-cyclic (QC) low-density parity-check (LDPC) codes are an important instance of proto-graph-based LDPC codes. In this paper… 
Review
2008
Review
2008
Image understanding for iris biometrics: A survey
Highly Cited
2003
Highly Cited
2003
Online Palmprint Identification
Biometrics-based personal identification is regarded as an effective method for automatically recognizing, with a high confidence… 
Highly Cited
2002
Highly Cited
2002
Generalized Hamming Distance
Many problems in information retrieval and related fields depend on a reliable measure of the distance or similarity between… 
Highly Cited
2000
Highly Cited
2000
On the Hamming distance of linear codes over a finite chain ring
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… 
Highly Cited
1999
Highly Cited
1999
The Variety of an Assortment
Consumers rank variety of assortment right behind location and price when naming reasons why they patronize their favorite stores… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)