Is there a decimal perfect code encoding 9 digits with 11 digits with a minimum distance of 3

Question

Since $\binom{11}{0} 9^0 + \binom{11}{1} 9^1 = 100$ there might be a perfect decimal code encoding 9 digits with 11 digits with minimum distance of 3. Is there?

Answer 1

A survey if perfect codes (J H Van Lint - 1975) states as Problem 2.7 (p. 205) :

Are there any perfect single-error-correcting codes over an alphabet $F$ for which $|F|$ is not a power of a prime?

(recall that "single-error-correcting" is equivalent to "minimum distance of 3")

According to the paper, there is no example of such a code known. And it cites the smaller candidate example $q=6$, $n=7$ to say that that is the this is the only case for which it has been shown that there is no perfect s.e.c. code.

Perhaps there are more conclusive results in more recent literature.