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, 1974, Volume 10, Issue 1, Pages 111–112 (Mi ppi1024)  
Сorrespondence

Binary Symmetric Channel Capacity Is Attained with Irreducible Codes

V. D. Goppa
Full-text PDF (272 kB)
Abstract: The asymptotic optimality of irreducible codes for a binary symmetric channel is proved.
Received: 31.07.1972
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: V. D. Goppa, “Binary Symmetric Channel Capacity Is Attained with Irreducible Codes”, Probl. Peredachi Inf., 10:1 (1974), 111–112; Problems Inform. Transmission, 10:1 (1974), 89–90
Citation in format AMSBIB
\Bibitem{Gop74}
\by V.~D.~Goppa
\paper Binary Symmetric Channel Capacity Is Attained with Irreducible Codes
\jour Probl. Peredachi Inf.
\yr 1974
\vol 10
\issue 1
\pages 111--112
\mathnet{http://mi.mathnet.ru/ppi1024}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=434610}
\zmath{https://zbmath.org/?q=an:0315.94007}
\transl
\jour Problems Inform. Transmission
\yr 1974
\vol 10
\issue 1
\pages 89--90
Linking options:
  • https://www.mathnet.ru/eng/ppi1024
  • https://www.mathnet.ru/eng/ppi/v10/i1/p111
    • 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, 2024