Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Block codeCodeCoding theoryError detection and correction

Broader (1)

Linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Binary code learning via optimal class representations
2016
2016
SOMH: A self-organizing map based topology preserving hashing method
2015
2015
Real-time near replica detection over massive streams of shared photos
Aquest treball es basa en la deteccio en temps real de repliques d'imatges en entorns distribuits a partir de la indexacio de… 
2014
2014
Randomized Intraclass-Distance Minimizing Binary Codes for face recognition
A new algorithm for learning binary codes is presented using randomized initial assignments of bit labels to classes followed by… 
2014
2014
Insight Centre for Data Analytics (DCU) at TRECVid 2014: Instance Search and Semantic Indexing Tasks
Insight-DCU participated in the instance search (INS) and semantic indexing (SIN) tasks in 2014. Two very different approaches… 
2007
2007
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007, Proceedings
2004
2004
On the identification problems in products of cycles
2002
2002
Minimization of Surrounding of Subsets in Hamming Space
As it is well-known, the classical isoperimetric problem on the plane claims to find a simple closured curve of the plane that… 
2002
2002
Epsilon-entropy of an Ellipsoid in a Hamming Space
Asymptotic behavior of the ε-entropy of an ellipsoid in a Hamming space is investigated as the dimension of the space grows. 
2002
2002
Classifying Subspaces of Hamming Spaces
A linear code in Fnq with dimension k and minimum distance at least d is called an [n, k, d]q code. We here consider the problem… 
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)