The Following Is an Error-Correcting Code in Which Any Two

Short Answer

The following is an error-correcting code in which any two patterns differ by a Hamming distance of at least three.
$\begin{array} { c c } \text { Symbol } & \text { Representation } \\\text { A } & 000000 \\\text { B } & 001111 \\\text { C } & 010011 \\\text { D } & 011100 \\\text { E } & 100110 \\\text { F } & 101001 \\\text { G } & 110101 \\\text { H } & 111010\end{array}$
Decode each of the following patterns
010011 ________ 101010 ________ 011000 ________ 101101 _______