The Hamming distance between two strings or vectors of equal length is the number of positions at which their corresponding symbols differ. Equivalently, it counts the minimum number of substitutions needed to turn one string into the other, or the minimum number of single-position errors that could transform one into the other. It is named for the American mathematician Richard Hamming and belongs to the broader family of string metrics used to measure the distance between two sequences. Its major application is in coding theory, particularly in the study of block codes, where the equal-length strings are treated as vectors over a finite field and the Hamming distance between codewords governs a code ability to detect and correct errors. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Connections
In Branch
Source Hamming Distance (Wikipedia)
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Sources
1. Hamming Distance (Wikipedia)
In Branch: Information Theory, Lead sentenceQuote, In Branch: Information Theory, Lead sentence
In information theory, the Hamming distance between two strings or vectors of equal length is the number of positions at which the
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.