Linked from

The 17 pages that link to Hamming distance, each with the reason it gives.

• Triangle inequalityRelated: Unlike squared distance, it satisfies the triangle inequality and defines a metric.

• Euclidean distanceCompared with: It compares discrete mismatches rather than geometric coordinate separation.

• Error-correcting codeRelated: The minimum distance between codewords determines how many errors a code can detect or correct.

• DistanceCompared with: It measures discrete disagreement instead of geometric straight-line separation.

• Reed–Solomon codeRelated: Reed–Solomon distance counts differing symbols, not differing bits.

• Coding theoryRelated: Minimum distance determines how many errors a code can detect or correct.

• Cosine similarityCompared with: It counts mismatches instead of comparing vector orientation.

• Parity bitRelated: Parity detects any odd number of bit flips because those flips change parity.

• Error detection and correctionRelated: Codeword distances determine how many errors a code can detect or correct.

• Gray codeRelated: Consecutive Gray-code words have Hamming distance one.

• Karnaugh mapRelated: Adjacent cells correspond to input patterns at Hamming distance one.

• Hamming codeRelated: The distance between codewords determines the errors a Hamming code can correct or detect.

• Gilbert–Varshamov boundRelated: Codewords must be separated by at least the prescribed minimum Hamming distance.

• Singleton boundNarrower topic: It supplies the distance measure used in the bound’s hypotheses.

• Hamming boundRelated: Minimum distance determines the radius of the disjoint balls used in the bound.

• John HopfieldRelated: It measures how many bit errors separate a noisy cue from a stored binary pattern.

• Reed–Solomon error correctionRelated: The minimum distance between codewords determines how many symbol errors can be corrected.