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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






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


Probl. Peredachi Inf., 1983, Volume 19, Issue 3, Pages 101–102 (Mi ppi1192)  

orrespondence

New Binary Codes with Minimum Distance 3

A. M. Romanov


Abstract: There exists a binary code of length 16 with minimum distance 3 between codewords, which contains more codewords than the code constructed by Sloane and Whitehead.

Full text: PDF file (265 kB)

Bibliographic databases:

UDC: 621.391.15
Received: 23.11.1982

Citation: A. M. Romanov, “New Binary Codes with Minimum Distance 3”, Probl. Peredachi Inf., 19:3 (1983), 101–102

Citation in format AMSBIB
\Bibitem{Rom83}
\by A.~M.~Romanov
\paper New Binary Codes with Minimum Distance~3
\jour Probl. Peredachi Inf.
\yr 1983
\vol 19
\issue 3
\pages 101--102
\mathnet{http://mi.mathnet.ru/ppi1192}
\zmath{https://zbmath.org/?q=an:0539.94023}


Linking options:
  • http://mi.mathnet.ru/eng/ppi1192
  • http://mi.mathnet.ru/eng/ppi/v19/i3/p101

    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
  •   Problems of Information Transmission
    Number of views:
    This page:238
    Full text:84
    First page:3

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