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, 2001, Volume 8, Number 1, Pages 55–76 (Mi da215)  

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

Nonsystematic perfect binary codes

S. A. Malyugin

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

Full text: PDF file (2546 kB)

Bibliographic databases:
UDC: 519.725
Received: 20.06.1999

Citation: S. A. Malyugin, “Nonsystematic perfect binary codes”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:1 (2001), 55–76

Citation in format AMSBIB
\Bibitem{Mal01}
\by S.~A.~Malyugin
\paper Nonsystematic perfect binary codes
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2001
\vol 8
\issue 1
\pages 55--76
\mathnet{http://mi.mathnet.ru/da215}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1846864}
\zmath{https://zbmath.org/?q=an:1007.94022}


Linking options:
  • http://mi.mathnet.ru/eng/da215
  • http://mi.mathnet.ru/eng/da/v8/s1/i1/p55

    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. A. M. Romanov, “A survey of methods for constructing nonlinear perfect binary codes”, J. Appl. Industr. Math., 2:2 (2008), 252–269  mathnet  crossref  mathscinet  zmath
    2. 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
    3. Solov'eva F.I., “On perfect binary codes”, Discrete Appl Math, 156:9 (2008), 1488–1498  crossref  mathscinet  zmath  isi  scopus
    4. S. A. Malyugin, “On nonsystematic perfect codes over finite fields”, J. Appl. Industr. Math., 4:2 (2010), 218–230  mathnet  crossref  mathscinet  zmath
    5. Avgustinovich S.V., Krotov D.S., “Embedding in a Perfect Code”, J Combin Des, 17:5 (2009), 419–423  crossref  mathscinet  zmath  isi  scopus
    6. S. A. Malyugin, “Affine nonsystematic codes”, J. Appl. Industr. Math., 6:4 (2012), 451–459  mathnet  crossref  mathscinet
    7. S. A. Malyugin, “Affine $3$-nonsystematic codes”, J. Appl. Industr. Math., 8:4 (2014), 552–556  mathnet  crossref  mathscinet
    8. S. A. Malyugin, “Affine $3$-nonsystematic perfect codes of length 15”, J. Appl. Industr. Math., 9:2 (2015), 251–262  mathnet  crossref  crossref  mathscinet  elib
    9. S. A. Malyugin, “Perfect binary codes of infinite length”, J. Appl. Industr. Math., 11:2 (2017), 227–235  mathnet  crossref  crossref  elib
  • Дискретный анализ и исследование операций
    Number of views:
    This page:411
    Full text:104

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