Category:Hamming Distance
Jump to navigation
Jump to search
This category contains results about Hamming Distance.
Definitions specific to this category can be found in Definitions/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.
Subcategories
This category has only the following subcategory.
E
- Examples of Hamming Distance (3 P)
Pages in category "Hamming Distance"
The following 2 pages are in this category, out of 2 total.