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

Hamming space

Known as: Code (coding theory), Code (disambiguation) 
In statistics and coding theory, a Hamming space is usually the set of all binary strings of length N. It is used in the theory of coding signals and… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Due to its computation efficiency and retrieval quality, hashing has been widely applied to approximate nearest neighbor search… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • table 2
Is this relevant?
2018
2018
Cross-modal hashing enables similarity retrieval across different content modalities, such as searching relevant images in… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2014
2014
Abstract Biometric technology is likely to provide a new level of security to various applications. Yet if the stored biometric… Expand
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Binary hashing has been widely used for efficient similarity search due to its query and storage efficiency. In most existing… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2012
Highly Cited
2012
There has been growing interest in mapping image data onto compact binary codes for fast near neighbor search in vision… Expand
Is this relevant?
2011
2011
In music information retrieval, a huge search space has to be explored because a query audio clip can start at any position of… Expand
  • figure 3
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Fast retrieval methods are critical for large-scale and data-driven vision applications. Recent work has explored ways to embed… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Universal bounds for the cardinality of codes in the Hamming space F/sub r//sup n/ with a given minimum distance d and/or dual… Expand
Is this relevant?
1988
1988
New curable compositions, comprising (1) a mixture of (a) from about 5 to about 90 percent by weight of a diaryl compound… Expand
Is this relevant?
1984
1984
The pair (A, B); A, B @? {0, 1}^m; is called an (m, @d)-system, if for the Hamming distance function d, d(a,b) = @d @? a @? A… Expand
Is this relevant?