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.
2012
2012
Secure Public Verification of IP Marks in FPGA Design Through a Zero-Knowledge Protocol
In nanometer technology regime, design components mandate their reuse to meet the complex design challenges and hence comprise… 
2008
2008
Comparative Analysis of Robust Fault Attack Resistant Architectures for Public and Private Cryptosystems
The adaptive and active nature of fault based side-channel attacks along with the large arsenal of fault injection methods… 
Highly Cited
2005
Highly Cited
2005
Two different approaches for iris recognition using Gabor filters and multiscale zero-crossing representation
2004
2004
Fuzzy hamming distance in a content-based image retrieval system
The performance of content-based image retrieval (CBIR) systems mainly depends on the image similarity measure that it uses. The… 
2003
2003
On Exact and Approximation Algorithms for Distinguishing Substring Selection
The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad… 
2002
2002
A hybrid search combining interior point methods and metaheuristics for 0–1 programming
Our search deals with methods hybridizing interior point processes and metaheuristics for solving 0-1 linear programs. This paper… 
Highly Cited
1997
Highly Cited
1997
Approaching Shannon's capacity limit by 0.2 dB using simple Hamming codes
The authors show that the Shannon capacity limit for the additive white Gaussian noise (AWGN) channel can be approached within 0… 
1997
1997
Dynamic operand interchange for low power
Power consumption of an execution unit can be reduced by interchanging its two input operands. A dynamic operand interchange… 
1976
1976
Concerning a bound on undetected error probability (Corresp.)
In the past, it has generally been assumed that the probability of undetected error for an (n,k) block code, used solely for… 
1974
1974
Optimal Rectangular Code for High Density Magnetic Tapes
IBM's 6250 bpi 3420 series tape units require a powerful error-correcting code for the standard 9-track format. The optimal… 
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)