Abstract:
For any admissible $N$ we present two constructions of different partitions of the $N$-dimensional vector space over $GF(q)$ into perfect $q$-ary codes, where $q>2$ is a power of a prime. The lower bounds on the number of such partitions are given. Bibl. 12.