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, 1989, Volume 25, Issue 3, Pages 103–107 (Mi ppi665)  
This article is cited in 2 scientific papers (total in 2 papers)

Сorrespondence

Decoding Complexity Bound for Linear Block Codes

E. A. Kruk
Full-text PDF (575 kB) Citations (2)
Abstract: A new complexity bound is derived for maximum-likelihood decoding of linear block codes in a memoryless $q$-ary symmetric channel. The bound is the best among all known bounds in the entire range of code rates.
Received: 08.06.1987
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: E. A. Kruk, “Decoding Complexity Bound for Linear Block Codes”, Probl. Peredachi Inf., 25:3 (1989), 103–107; Problems Inform. Transmission, 25:3 (1989), 251–254
Citation in format AMSBIB
\Bibitem{Kru89}
\by E.~A.~Kruk
\paper Decoding Complexity Bound for Linear Block Codes
\jour Probl. Peredachi Inf.
\yr 1989
\vol 25
\issue 3
\pages 103--107
\mathnet{http://mi.mathnet.ru/ppi665}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1021204}
\zmath{https://zbmath.org/?q=an:0696.94016|0685.94007}
\transl
\jour Problems Inform. Transmission
\yr 1989
\vol 25
\issue 3
\pages 251--254
Linking options:
  • https://www.mathnet.ru/eng/ppi665
  • https://www.mathnet.ru/eng/ppi/v25/i3/p103
    • This publication is cited in the following 2 articles:
    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:746
    Full-text PDF :276
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024