# puzzle on [13,10,3] perfect Hamming code over $\mathbb F_{3}$

The soccer betting form contains a list of 13 games. There are three possible outcomes for each game: “the first team won”, “the second team won” and “draw”. Each betting form allows to chose one outcome for each game.In order to win a big prize, it is required to guess correctly the results of at least 12 games. What is the minimum number of forms Alex has to fill in to ensure that he wins a big prize?

Hint: There exists a perfect Hamming code with parameters [13,10,3] over $\mathbb F_{3}$

Any suggestions on how to solve this puzzle

-
Hint: the perfect Hamming code has the property that every vector in $\mathbb F_3^{13}$ is either a codeword in the code or is at Hamming distance $1$ from some codeword. Every possible result of the $13$ games can be expressed as a vector in $\mathbb F_3^{13}$. Now think! – Dilip Sarwate Apr 20 '14 at 14:20
Thanks a lot @DilipSarwate it helps. – kingmakerking Apr 21 '14 at 11:21