Hamming radius
Type: Concept
As of November 2026, Hamming radius has been mentioned in one podcast episode on ICLR (Apr 2014). Parameter used in retrieval systems to define the search radius.
In information theory, the Hamming distance between two strings or vectors of equal length is the number of positions at which the corresponding symbols are different. In other words, it measures the minimum number of substitutions required to change one string into the other, or equivalently, the minimum number of errors that could have transformed one string into the other. In a more general context, the Hamming distance is one of several string metrics for measuring the edit distance between
| Mentioned in | 1 episode on 1 podcast (as of November 2026) |
|---|---|
| First heard | Apr 2014 on ICLR |
| Field | Computer Science |
Who talks about Hamming radius on podcasts?
Hamming radius came up; the most recent mention was Apr 2014 on ICLR.
- ICLR14: J Masci: Sparse similarity-preserving hashing on ICLR (Apr 2014)
What is Hamming radius mentioned alongside?
Hamming radius is most often mentioned alongside Multi-modal data, Collision and Meta Siamese Network.
Mentioned together: Multi-modal data, Collision, Meta Siamese Network, Cross SSH, Cross-modal learning, Recall, Feature space, Binary vectors, YouTube, Facebook