RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., 2009 Volume 16, Issue 3, Pages 63–73 (Mi da574)

This article is cited in 6 papers

On partitions into perfect $q$-ary codes

F. I. Solov'evaab, A. V. Los'ba

a Novosibirsk State University, Novosibirsk, Russia
b S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia

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.

UDC: 519.2+621.391

Received: 28.10.2008
Revised: 01.04.2009


 English version:
Journal of Applied and Industrial Mathematics, 2010, 4:1, 136–142

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026