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 1, Pages 24–32 (Mi ppi635)  

Coding Theory

Two Decoding Algorithms for Linear Codes

I. I. Dumer
Abstract: We propose an algorithm to compute the nearest codeword in a BSC. For a linear code of length $n$ and rate $R$, the algorithm executes in time of order $2^{n(1-R)/2}$. For codes with distance $d$ increasing linearly with length, we propose an algorithm capable of correcting $[(d-1)/2]$+const errors which involves a linearly increasing number of attempts to correct $[(d-1)/2]$ errors.
Received: 27.05.1986
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: I. I. Dumer, “Two Decoding Algorithms for Linear Codes”, Probl. Peredachi Inf., 25:1 (1989), 24–32; Problems Inform. Transmission, 25:1 (1989), 17–23
Citation in format AMSBIB
\Bibitem{Dum89}
\by I.~I.~Dumer
\paper Two Decoding Algorithms for Linear Codes
\jour Probl. Peredachi Inf.
\yr 1989
\vol 25
\issue 1
\pages 24--32
\mathnet{http://mi.mathnet.ru/ppi635}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=994106}
\zmath{https://zbmath.org/?q=an:0708.94017}
\transl
\jour Problems Inform. Transmission
\yr 1989
\vol 25
\issue 1
\pages 17--23
Linking options:
  • https://www.mathnet.ru/eng/ppi635
  • https://www.mathnet.ru/eng/ppi/v25/i1/p24
  • 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:837
    Full-text PDF :649
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024