In statistics and coding theory, a Hamming space is usually the set of all 2 N {\displaystyle 2^{N}} binary strings of length N, where different binary strings are considered to be adjacent when they differ only in one position. The total distance between any two binary strings is then the total number of positions at which the corresponding bits are different, called the Hamming distance.
In statistics and coding theory, a Hamming space is usually the set of all 2 N {\displaystyle 2^{N}} binary strings of length N, where different binary strings are considered to be adjacent when they differ only in one position. The total distance between any two binary strings is then the total number of positions at which the corresponding bits are different, called the Hamming distance.
Source: Wikipedia "Hamming space" · CC BY-SA 4.0
Share this article: X · Bluesky