Explain how the duplication code given by {00,11,22} with letters in the set $\mathbb{Z}$/3 can detect one error.
If I were to construct a table of Hamming distances, I would show that the minimal distance is 2, and thus the error detection is 1 because C is n error detecting iff the minimal distance is $\geq$ n+1
Is this correct?