Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

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


Diskretnyi Analiz i Issledovanie Operatsii, Ser. 2, 1999, Volume 6, Issue 2, Pages 48–73 (Mi da342)  

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

Enumeration of perfect binary codes of length 15

S. A. Malyugin

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Received: 07.09.1999
Bibliographic databases:
UDC: 519.72
Language: Russian
Citation: S. A. Malyugin, “Enumeration of perfect binary codes of length 15”, Diskretn. Anal. Issled. Oper., Ser. 2, 6:2 (1999), 48–73
Citation in format AMSBIB
\Bibitem{Mal99}
\by S.~A.~Malyugin
\paper Enumeration of perfect binary codes of length~15
\jour Diskretn. Anal. Issled. Oper., Ser.~2
\yr 1999
\vol 6
\issue 2
\pages 48--73
\mathnet{http://mi.mathnet.ru/da342}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1762445}
\zmath{https://zbmath.org/?q=an:1008.94026}
Linking options:
  • https://www.mathnet.ru/eng/da342
  • https://www.mathnet.ru/eng/da/v6/s2/i2/p48
  • This publication is cited in the following 9 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:246
    Full-text PDF :147
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024