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, 1993, Volume 29, Issue 4, Pages 18–23 (Mi ppi197)  
Coding Theory

Decoding Complexity of Linear Block Codes

S. V. Fedorenko
Full-text PDF (707 kB)
Abstract: We suggest a method of constructing a nonrandom covering with complexity asymptotically equal to the size of this covering. We also present an implementation of a nonprobabilistic decoding algorithm with nonexponential space complexity.
Received: 27.11.1992
Revised: 29.03.1993
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: S. V. Fedorenko, “Decoding Complexity of Linear Block Codes”, Probl. Peredachi Inf., 29:4 (1993), 18–23; Problems Inform. Transmission, 9:4 (1993), 313–317
Citation in format AMSBIB
\Bibitem{Fed93}
\by S.~V.~Fedorenko
\paper Decoding Complexity of Linear Block Codes
\jour Probl. Peredachi Inf.
\yr 1993
\vol 29
\issue 4
\pages 18--23
\mathnet{http://mi.mathnet.ru/ppi197}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1257593}
\zmath{https://zbmath.org/?q=an:0810.94034}
\transl
\jour Problems Inform. Transmission
\yr 1993
\vol 9
\issue 4
\pages 313--317
Linking options:
  • https://www.mathnet.ru/eng/ppi197
  • https://www.mathnet.ru/eng/ppi/v29/i4/p18
    • 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:346
    Full-text PDF :203
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024