Category:Examples of Hamming Distance
Jump to navigation
Jump to search
This category contains examples of Hamming Distance.
Let $u$ and $v$ be two codewords of a linear code.
The Hamming distance between $u$ and $v$ is the number of corresponding terms at which $u$ and $v$ are different.
Pages in category "Examples of Hamming Distance"
The following 3 pages are in this category, out of 3 total.