ConceptMathematics
Hamming distance
Hamming distance measures the number of positions at corresponding symbols are different between two strings of equal length.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Hamming ball2Minimum distance2Shifted Hamming distance2Concatenated codes1False positive / false accept1Fractional Hamming distance1Hamming weight1Isolated satisfying assignment1Kleitman's diameter theorem1Minimum distance of a linear code1Normalized Hamming distance1Overlapping lookup table operation1
Lecturers
6Each in their own terms, from the easiest level.
Ankur Moitra
The number of coordinates where two vectors differ.Peter Shor
The Hamming distance between two vectors is the number of positions at which the corresponding symbols are different.Ryan O'Donnell
The number of coordinates at which two strings differ, used to measure similarity between strings in adversary methods.Onur Mutlu
A metric for comparing two strings of equal length that counts the number of positions at which the corresponding symbols are different.Vladimir Dragovich
The number of positions at which the corresponding symbols in two binary words of equal length are different.
Lectures that assume it
8Connections
24The lectures that define it or assume it, and the concepts next to it.
Concepts9
Show 3 moreShow fewer
Lectures15
- Arch4Health: 4th Workshop on Architecture for Health
- Error Correcting Codes
- The Adversary Method in Quantum Query Complexity
- Transmitting Information Reliably over a Noisy Channel & Shannon’s Noisy Coding Theorem
- Complexity of Lasso with Normalized Data
- GateKeeper: FPGA-Accelerated Pre-Alignment Filtering
Show 9 moreShow fewer
- Error-Correcting Codes—Hamming Codes
- The Fourier Expansion and Basic Formulas
- Expander Graphs Application 1: Good Codes
- Binomial Coefficients Asymptotics
- Reed-Solomon Codes
- Ironic Complexity
- Linear Error Correcting Codes
- Probabilistically Checkable Proofs of Proximity
- Neuroscience-Inspired Artificial Intelligence