| Display title | Hamming distance |
| Default sort key | Hamming distance |
| Page length (in bytes) | 16,468 |
| Namespace ID | 0 |
| Page ID | 178642 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Carolyn |
| Date of page creation | 05:22, 9 March 2024 |
| Latest editor | imported>Carolyn |
| Date of latest edit | 05:22, 9 March 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In information theory, the Hamming distance between two strings or vectors of equal length is the number of positions at which the corresponding symbols are different. In other words, it measures the minimum number of substitutions required to change one string into the other, or equivalently, the minimum... |
