Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,226,771 papers from all fields of science
Search
Sign In
Create Free Account
Hamming distance
Known as:
Hamming cube
, Minimum Hamming distance
, Substitution distance
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Admissible heuristic
Belief revision
Biometrics
Bitwise operation
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties
Gen-Nian Ge
,
Y. Miao
,
Zhongxiang Yao
IEEE Transactions on Information Theory
2009
Corpus ID: 206737624
Frequency hopping (FH) sequences play a key role in frequency hopping spread spectrum communication systems. In order to evaluate…
Expand
2006
2006
Gait Recognition Using Multiple Projections
M. Ekinci
International Conference on Automatic Face and…
2006
Corpus ID: 10244177
This paper presents a new method for automatic gait recognition based on analyzing the multiple projections to silhouette using…
Expand
2005
2005
Multistage parallel interference cancellation: convergence behavior and improved performance through limit cycle mitigation
D. R. Brown
IEEE Transactions on Signal Processing
2005
Corpus ID: 8729143
This paper investigates the convergence behavior of the hard-decision multistage parallel interference cancellation (PIC…
Expand
2004
2004
Fuzzy hamming distance in a content-based image retrieval system
M. Ionescu
,
A. Ralescu
IEEE International Conference on Fuzzy Systems
2004
Corpus ID: 18751562
The performance of content-based image retrieval (CBIR) systems mainly depends on the image similarity measure that it uses. The…
Expand
Highly Cited
1997
Highly Cited
1997
Approaching Shannon's capacity limit by 0.2 dB using simple Hamming codes
H. Nickl
,
J. Hagenauer
,
F. Burkert
IEEE Communications Letters
1997
Corpus ID: 6608427
The authors show that the Shannon capacity limit for the additive white Gaussian noise (AWGN) channel can be approached within 0…
Expand
1997
1997
Document image compression and analysis
O. Kia
1997
Corpus ID: 58763152
Image compression usually considers the minimization of storage space as its main objective. It is desirable, however, to code…
Expand
1991
1991
DC-constrained error-correcting codes with small running digital sum
G. Cohen
,
S. Litsyn
IEEE Transactions on Information Theory
1991
Corpus ID: 33710530
The authors investigate the problem of evaluating the possible size of error-correcting codes with code words taken from a subset…
Expand
1977
1977
The extended Nadler code is unique (Corresp.)
J. Goethals
IEEE Transactions on Information Theory
1977
Corpus ID: 20430974
Constructions for a 32-word binary code of length 12 and minimum distance 5 were given by Nadler in 1962 and van Lint in 1972…
Expand
1976
1976
Concerning a bound on undetected error probability (Corresp.)
S. K. Leung-Yan-Cheong
,
M. Hellman
IEEE Transactions on Information Theory
1976
Corpus ID: 2682648
In the past, it has generally been assumed that the probability of undetected error for an (n,k) block code, used solely for…
Expand
1968
1968
Error propagation and definite decoding of convolutional codes
John P. Robinson
IEEE Transactions on Information Theory
1968
Corpus ID: 35178235
The error-propagation effect in decoding convolutional codes is a result of the internal feedback in the usual decoding method…
Expand