Hermit
Auto-translated
I don't know, but for some reason, it seems to me that a hash sum of this kind might work:
-1*(bit1) + 2*(bit2) - 3*(bit3) + 4*(bit4)
That is, examples of messages:
0000 (main part) 000 (hash sum)
0001 100
0010 101
0011 001
0100 010
1000 111
But I find it difficult to prove or disprove that this will work. At first glance, it seems that there are errors. However, it is possible that I simply missed a situation where this is not the case.
I didn't quite understand how to create a sequence if there are negative numbers, but here's a question: let's say we received 0001000. How do we know if this was 0000000 and the fourth bit was corrupted from 0 to 1, or 0001100 and the fifth bit was corrupted from 1 to 0?
Всё не так плохо как Вы думаете. Всё намного хуже!