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, 1967, Volume 3, Issue 4, Pages 58–71 (Mi ppi1922)  

Bounds of the Probability and of the Number of Correctable Errors for Nonblock Codes

M. S. Pinsker
Abstract: Upper bounds are derived for the number of correctable errors for nonblock codes. Explicit expressions are given for the upper limits of the power of a code as the decoding delay $\tau\to\infty$ for the case where a fixed number $t$ of errors may occur in the interval $\tau$, and for the case where the number of errors $t=\alpha\tau$ increases linearly with $\tau$. These bounds are similar to the Hamming and Elias bounds for block codes. The upper limit of the error probability is also calculated for nonblock transmission over a binary symmetric memoryless channel: the exponential term of this limit is the same as the exponential term for block codes of length $\tau$. It is shown that for transmission rates tending to zero, the exponential term of the error probability converges to the exponential term of the error probability for block transmission at zero rate. It is shown that many estimates also remain valid when feedback is present.
Received: 19.04.1967
Bibliographic databases:
UDC: 621.391.15:519.2
Language: Russian
Citation: M. S. Pinsker, “Bounds of the Probability and of the Number of Correctable Errors for Nonblock Codes”, Probl. Peredachi Inf., 3:4 (1967), 58–71; Problems Inform. Transmission, 3:4 (1967), 44–55
Citation in format AMSBIB
\Bibitem{Pin67}
\by M.~S.~Pinsker
\paper Bounds of the Probability and of the Number of Correctable Errors for Nonblock Codes
\jour Probl. Peredachi Inf.
\yr 1967
\vol 3
\issue 4
\pages 58--71
\mathnet{http://mi.mathnet.ru/ppi1922}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=323444}
\zmath{https://zbmath.org/?q=an:0262.94012}
\transl
\jour Problems Inform. Transmission
\yr 1967
\vol 3
\issue 4
\pages 44--55
Linking options:
  • https://www.mathnet.ru/eng/ppi1922
  • https://www.mathnet.ru/eng/ppi/v3/i4/p58
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024