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, 1984, Volume 20, Issue 1, Pages 105–109 (Mi ppi1126)  
Сorrespondence

Comparision of Decoding Comlexity for Truncated Convolutional Codes and Block Codes

V. V. Zyablov, S. A. Shavgulidze
Full-text PDF (475 kB)
Abstract: We compare the complexity of maximum likelihood decoding of truncated convolutional codes with that of best known block codes.
Received: 19.04.1982
Bibliographic databases:
Document Type: Article
UDC: 621.391.15:519.72
Language: Russian
Citation: V. V. Zyablov, S. A. Shavgulidze, “Comparision of Decoding Comlexity for Truncated Convolutional Codes and Block Codes”, Probl. Peredachi Inf., 20:1 (1984), 105–109
Citation in format AMSBIB
\Bibitem{ZyaSha84}
\by V.~V.~Zyablov, S.~A.~Shavgulidze
\paper Comparision of Decoding Comlexity for Truncated Convolutional Codes and Block Codes
\jour Probl. Peredachi Inf.
\yr 1984
\vol 20
\issue 1
\pages 105--109
\mathnet{http://mi.mathnet.ru/ppi1126}
\zmath{https://zbmath.org/?q=an:0552.94013}
Linking options:
  • https://www.mathnet.ru/eng/ppi1126
  • https://www.mathnet.ru/eng/ppi/v20/i1/p105
    • 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:335
    Full-text PDF :156
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024