RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 2013, Volume 20, Number 2, Pages 15–25 (Mi da723)  

On partitions of an $n$-cube into perfect binary codes

G. K. Guskov

Sobolev Institute of Mathematics, Novosibirsk, Russia

Abstract: A switching construction of partitions of an $n$-cube is studied. A new lower bound on the number of such partitions of rank that exceeds the rank of the Hamming code of the same length at most by 2 is established. Bibliogr. 17.

Keywords: perfect binary code, partition of an $n$-cube, rank of partition into perfect codes, lower bound on the number of partitions.

Full text: PDF file (266 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 519.8
Received: 27.04.2012
Revised: 04.02.2013

Citation: G. K. Guskov, “On partitions of an $n$-cube into perfect binary codes”, Diskretn. Anal. Issled. Oper., 20:2 (2013), 15–25

Citation in format AMSBIB
\Bibitem{Gus13}
\by G.~K.~Guskov
\paper On partitions of an $n$-cube into perfect binary codes
\jour Diskretn. Anal. Issled. Oper.
\yr 2013
\vol 20
\issue 2
\pages 15--25
\mathnet{http://mi.mathnet.ru/da723}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3113078}


Linking options:
  • http://mi.mathnet.ru/eng/da723
  • http://mi.mathnet.ru/eng/da/v20/i2/p15

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Дискретный анализ и исследование операций
    Number of views:
    This page:121
    Full text:35
    References:28
    First page:5

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019