Cybernetiks
Perfect codes of all admissible length n>15 with the rank r < n and the kernel of dimension k for each k in {(n-1)/2,...,U(n)} are presented (here U(n) is dimension of maximal possible kernel of a full rank perfect code of length n). Full rank perfect codes of all admissible length n>210-1 with a kernel of dimension k for each k in {(n-1)/2,...,U(n)} are given. For length 31 <= n <= 210-1 the same result for each k in {(n-1)/2,...,U(n)-2} is true.
Additional information:
Note. Abstracts are published in author's editionComments |
[Home] [Conference] |
©2001, Siberian Branch of Russian Academy of Science, Novosibirsk
©2001, United Institute of Computer Science SB RAS, Novosibirsk
©2001, Institute of Computational Techologies SB RAS, Novosibirsk
©2001, A.P. Ershov Institute of Informatics Systems SB RAS, Novosibirsk
©2001, Institute of Mathematics SB RAS, Novosibirsk
©2001, Institute of Cytology and Genetics SB RAS, Novosibirsk
©2001, Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk
©2001, Novosibirsk State University
Last modified 06-Jul-2012 (11:45:21)