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, 1966, Volume 2, Issue 2, Pages 12–28 (Mi ppi1930)  
Estimate of the Complexity of Sequential Decoding of Random Tree Codes

V. N. Koshelev
Full-text PDF (2514 kB)
Abstract: An algorithm of a modification of sequential decoding is described, and estimates are obtained characterizing the complexity and reliability of the method.
Received: 01.10.1965
Bibliographic databases:
UDC: 621.391.156
Language: Russian
Citation: V. N. Koshelev, “Estimate of the Complexity of Sequential Decoding of Random Tree Codes”, Probl. Peredachi Inf., 2:2 (1966), 12–28; Problems Inform. Transmission, 2:2 (1966), 8–20
Citation in format AMSBIB
\Bibitem{Kos66}
\by V.~N.~Koshelev
\paper Estimate of the Complexity of Sequential Decoding of Random Tree Codes
\jour Probl. Peredachi Inf.
\yr 1966
\vol 2
\issue 2
\pages 12--28
\mathnet{http://mi.mathnet.ru/ppi1930}
\zmath{https://zbmath.org/?q=an:0295.94031}
\transl
\jour Problems Inform. Transmission
\yr 1966
\vol 2
\issue 2
\pages 8--20
Linking options:
  • https://www.mathnet.ru/eng/ppi1930
  • https://www.mathnet.ru/eng/ppi/v2/i2/p12
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:202
    Full-text PDF :109
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025