Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
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… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
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… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Today's networks typically carry or deploy dozens of protocols and mechanisms simultaneously such as MPLS, NAT, ACLs and route… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… Expand
  • figure 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The problem of error control in random linear network coding is addressed from a matrix perspective that is closely related to… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We introduce a new type of Identity-Based Encryption (IBE) scheme that we call Fuzzy Identity-Based Encryption. In Fuzzy IBE we… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Biometrics-based personal identification is regarded as an effective method for automatically recognizing, with a high confidence… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Transmit beamforming and receive combining are simple methods for exploiting the significant diversity that is available in… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The problems of authentication and identification have received wide interest in cryptographic research. However, there has been… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?