I've been struggling with several Hamming code/error detection questions because the logic behind it doesn't seem to make sense.
I don't really understand the above two examples and the calculations taking place.
How were the conclusions reached concerning the categories of bin position (dec/bin), parity/data bit and value in e.g 1?
Secondly I don't understand the process taking place in e.g. 2 at all. Does it follow that:
General rule: For any code C,
- errors of less than $d(C)$ bits can be detected,
- errors of less than $d(C)/2$ bits can be corrected.
Definition: A code C with $d(C) \geq 3$ is called error-correcting.
If this is correct then how would I put it into practice. Would really appreciate some assistance!