Problemy Peredachi Informatsii
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


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




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

Problemy Peredachi Informatsii, 1983, Volume 19, Issue 3, Pages 101–102 (Mi ppi1192)  
Сorrespondence

New Binary Codes with Minimum Distance 3

A. M. Romanov
Full-text PDF (265 kB)
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.
Received: 23.11.1982
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
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:
  • https://www.mathnet.ru/eng/ppi1192
  • https://www.mathnet.ru/eng/ppi/v19/i3/p101
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025