Loading [MathJax]/jax/output/CommonHTML/jax.js
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, 1977, Volume 13, Issue 1, Pages 3–18 (Mi ppi1062)  
This article is cited in 3 scientific papers (total in 3 papers)

Information Theory

Bounds on the Probability of Undetected Error

V. I. Levenshtein
Full-text PDF (1661 kB) Citations (3)
Abstract: New upper and lower bounds are obtained for the probability of undetected error for block codes in a binary symmetrical channel (BSC). These bounds improve the available bounds by a factor that increases exponentially with the block length n, provided that the transmission rate is fixed and does not exceed the capacity of the BSC. The resultant bounds are used to select the parameters of a quasioptimal code for transmission over a BSC with instantaneous and noiseless feedback.
Received: 04.11.1975
Bibliographic databases:
Document Type: Article
UDC: 621.391.15, 519.2
Language: Russian
Citation: V. I. Levenshtein, “Bounds on the Probability of Undetected Error”, Probl. Peredachi Inf., 13:1 (1977), 3–18; Problems Inform. Transmission, 13:1 (1977), 1–12
Citation in format AMSBIB
\Bibitem{Lev77}
\by V.~I.~Levenshtein
\paper Bounds on the Probability of Undetected Error
\jour Probl. Peredachi Inf.
\yr 1977
\vol 13
\issue 1
\pages 3--18
\mathnet{http://mi.mathnet.ru/ppi1062}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=689169}
\zmath{https://zbmath.org/?q=an:0355.94020}
\transl
\jour Problems Inform. Transmission
\yr 1977
\vol 13
\issue 1
\pages 1--12
Linking options:
  • https://www.mathnet.ru/eng/ppi1062
  • https://www.mathnet.ru/eng/ppi/v13/i1/p3
    • This publication is cited in the following 3 articles:
    1. M. V. Burnashev, “On lower bounds on the spectrum of a binary code”, Problems Inform. Transmission, 55:4 (2019), 366–375  mathnet  crossref  crossref  isi  elib
    2. Helleseth, T, “Error-correction capability of binary linear codes”, IEEE Transactions on Information Theory, 51:4 (2005), 1408  crossref  mathscinet  isi
    3. Litsyn, S, “New upper bounds on error exponents”, IEEE Transactions on Information Theory, 45:2 (1999), 385  crossref  isi
    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:471
    Full-text PDF :235
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025