Firstly, I would like to apologize if I misplaced this topic / i think the theory of coding is close to CS /
I am little bit confused right now, in the school we were learning about Hamming's code, Block codes etc.
I was given a homework, in which I should explain how does the two dimensional parity check finds 3-bit errors. I think the two-dimensional parity check does finds 3-bit erros, but it can't (in every case) correct it.
The second thing is, we were learning about hamming distance and there is a rule, which says that block code finds t-bit error when this equation is right:
t < d (and d stands for hamming distance, its minimum distance between the 2 code words / t stands for t-bit errors).
So for example: a = 110, b = 101, c = 100
1 1 0 | 0 1 0 1 | 0 1 0 0 | 1 _ _ __ 1 1 1 1
The numbers behind the 'bars/underscores' are the parity-check bits, it means that in each column/row is even count of number 1.
So the minimum distance equals to 2. That means according to the rule t < d, that this code can detect only a t-bit error, which means 1 ( but that's not true, because it can detect 3 bit erros).
How should I explain that?.