What is Hamming distance?

Question

Algorithms

I started reading the Tanenbaum Computer Architecture, it described a method for correcting errors through the Hamming distance, but I didn’t understand anything, tell me where it is explained in an accessible language how it works?

Answer 1

FIG knows how to explain in an accessible way, but I'll try.
For example, there are two vectors A ₁ and A ₂ .
The length of A ₁ is 10 and the length of A ₂ is 10.
The distance will be the same because there are no discrepancies.
If you increase the length of one of the vectors, then the difference in lengths will just be the Hamming distance.
But this is a bad example, but a good place to start.
Another example closer to life.
Let's take two strings (in the same place, the length of the compared objects must be the same everywhere).
For example, let it be like this:
$a = "abcdef";
$b = "abcfe";
We have the same string lengths, but they are bit-by-bit different, so you can find the distance.
It will be equal to two: in the first and second line, the last two bytes are different.
That is, having two strings of the same length, we compare them byte by byte and the number of different bytes is the Hamming distance.
I'm not very sure that this is the right explanation, but I hope it gets the point across.

Answer 2

https://ru.wikipedia.org/wiki/%D0%A0%D0%B0%D1%81%D...
What is not clear here?