Une nouvelle famille de 3-codes parfaits sur GF(q) (Q800296)

\textit{Yu. L. Vasil'ev} [Probl. Kibern. 8, 337-339 (1962; Zbl 0202.503)] showed how to construct a perfect single error correcting binary code (in general not linear) of length \(2n+1\), given a perfect s.e.c. code of length n. The method was generalized to GF(q) by \textit{J. Schönheim} [Inf. Control 12, 23-26 (1968; Zbl 0162.512)] and \textit{B. Lindström} [Math. Scand. 25, 149-158 (1969; Zbl 0205.469)]. \textit{K. T. Phelps} constructed other perfect s.e.c. codes using a method very similar to Vasil'ev's construction [see the paper reviewed below]. The present paper shows that Phelps' method also applies to codes over GF(q). It is noteworthy that the perfect codes found by \textit{H. Bauer}, \textit{B. Ganter} and \textit{F. Hergert} [Combinatorica 3, 21-33 (1983; Zbl 0525.94011)] cannot be constructed by the methods mentioned above.