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., Ser. 1, 1999, Volume 6, Number 4, Pages 44–48 (Mi da327)  

This article is cited in 6 scientific papers (total in 6 papers)

On a lower bound for the number of perfect binary codes

S. A. Malyugin

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Full text: PDF file (472 kB)

Bibliographic databases:
UDC: 519.72
Received: 03.08.1999

Citation: S. A. Malyugin, “On a lower bound for the number of perfect binary codes”, Diskretn. Anal. Issled. Oper., Ser. 1, 6:4 (1999), 44–48

Citation in format AMSBIB
\Bibitem{Mal99}
\by S.~A.~Malyugin
\paper On a~lower bound for the number of perfect binary codes
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 1999
\vol 6
\issue 4
\pages 44--48
\mathnet{http://mi.mathnet.ru/da327}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1760729}
\zmath{https://zbmath.org/?q=an:0930.94046}


Linking options:
  • http://mi.mathnet.ru/eng/da327
  • http://mi.mathnet.ru/eng/da/v6/s1/i4/p44

    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

    This publication is cited in the following articles:
    1. S. A. Malyugin, A. M. Romanov, “O razbieniyakh kodov Khemminga na neperesekayuschiesya komponenty”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 9:1 (2002), 42–48  mathnet  mathscinet  zmath
    2. A. V. Los', “Constructing Perfect $q$-ary Codes by Sequential Switchings of $\tilde\alpha$-Components”, Problems Inform. Transmission, 40:1 (2004), 37–43  mathnet  crossref  mathscinet  zmath
    3. Malyugin S.A., “On enumeration of the perfect binary codes of length 15”, Discrete Appl Math, 135:1–3 (2004), 161–181  crossref  mathscinet  isi  scopus
    4. S. A. Malyugin, “On enumeration of nonequivalent perfect binary codes of length 15 and rank 15”, J. Appl. Industr. Math., 1:1 (2007), 77–89  mathnet  crossref  mathscinet  zmath
    5. Solov'eva F.I., “On perfect binary codes”, Discrete Appl Math, 156:9 (2008), 1488–1498  crossref  mathscinet  zmath  isi  scopus
    6. A. D. Korshunov, “Some unsolved problems in discrete mathematics and mathematical cybernetics”, Russian Math. Surveys, 64:5 (2009), 787–803  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib
  • Дискретный анализ и исследование операций
    Number of views:
    This page:188
    Full text:80

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