Constructions of partitions of F N q into perfect q-ary codes
F. I. Solov’eva, A. V. Los’ · Journal of Applied and Industrial Mathematics · 2010
Given N = (q m − 1)/(q − 1), where q is a power of a prime, q > 2, we present two constructions of different partitions of the set F of all q-ary length N vectors into perfect q-ary codes of length N. The lower bounds on the number of these partitions are presented.