|
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2010, Volume 7, Pages 425–434
(Mi semr257)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Research papers
On partitions into affine nonequivalent perfect $q$-ary codes
A. V. Los'ab, F. I. Solov'evaab a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b Novosibirsk State University
Abstract:
It is proved that there exists a partition of the set $F^N_q$ of all $q$-ary vectors of length $N$ into pairwise affine nonequivalent perfect $q$-ary codes of length $N$ with the Hamming distance $3$ for any
$N=(q^m-1)/(q-1)$, where $q=p^r,$ $p$ is prime.
Keywords:
perfect $q$-ary code, partition into perfect codes, switching, affine nonequivalence of codes.
Received November 4, 2010, published November 18, 2010
Citation:
A. V. Los', F. I. Solov'eva, “On partitions into affine nonequivalent perfect $q$-ary codes”, Sib. Èlektron. Mat. Izv., 7 (2010), 425–434
Linking options:
https://www.mathnet.ru/eng/semr257 https://www.mathnet.ru/eng/semr/v7/p425
|
Statistics & downloads: |
Abstract page: | 236 | Full-text PDF : | 66 | References: | 47 |
|