Loading [MathJax]/jax/output/SVG/config.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, 1968, Volume 4, Issue 4, Pages 37–48 (Mi ppi1871)  

This article is cited in 17 scientific papers (total in 17 papers)

Bounds for the Exponent of the Probability of Error for a Semicontinuous Memoryless Channel

E. A. Haroutunian
Abstract: Coincident lower and upper bounds for the exponent of the probability of incorrect decoding for optimum transmission of information along a semicontinuous memoryless channel at rates close to the channel capacity are constructed. The bounds coincide in the case of a discrete channel with the Fano [R. M. Fano, Transmission of Information, New York, M.I.T. Press, 1961] bounds, but have a new analytic form.
Received: 04.10.1967
Bibliographic databases:
UDC: 621.391.1:519.28
Language: Russian
Citation: E. A. Haroutunian, “Bounds for the Exponent of the Probability of Error for a Semicontinuous Memoryless Channel”, Probl. Peredachi Inf., 4:4 (1968), 37–48; Problems Inform. Transmission, 4:4 (1968), 29–39
Citation in format AMSBIB
\Bibitem{Har68}
\by E.~A.~Haroutunian
\paper Bounds for the Exponent of the Probability of Error for a~Semicontinuous Memoryless Channel
\jour Probl. Peredachi Inf.
\yr 1968
\vol 4
\issue 4
\pages 37--48
\mathnet{http://mi.mathnet.ru/ppi1871}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=351624}
\zmath{https://zbmath.org/?q=an:0256.94022}
\transl
\jour Problems Inform. Transmission
\yr 1968
\vol 4
\issue 4
\pages 29--39
Linking options:
  • https://www.mathnet.ru/eng/ppi1871
  • https://www.mathnet.ru/eng/ppi/v4/i4/p37
  • This publication is cited in the following 17 articles:
    1. Vazquez-Vilar G., “Error Probability Bounds For Gaussian Channels Under Maximal and Average Power Constraints”, IEEE Trans. Inf. Theory, 67:6 (2021), 3965–3985  crossref  mathscinet  zmath  isi  scopus
    2. Mosonyi M. Ogawa T., “Divergence Radii and the Strong Converse Exponent of Classical-Quantum Channel Coding With Constant Compositions”, IEEE Trans. Inf. Theory, 67:3 (2021), 1668–1698  crossref  mathscinet  zmath  isi  scopus
    3. Verdu S., “Error Exponents and Alpha-Mutual Information”, Entropy, 23:2 (2021), 199  crossref  mathscinet  isi  scopus
    4. B. Nakiboğlu, “The sphere packing bound for memoryless channels”, Problems Inform. Transmission, 56:3 (2020), 201–244  mathnet  crossref  crossref  isi  elib
    5. Tyagi H. Watanabe Sh., “Strong Converse Using Change of Measure Arguments”, IEEE Trans. Inf. Theory, 66:2 (2020), 689–703  crossref  mathscinet  zmath  isi  scopus
    6. Nakiboglu B., “a Simple Derivation of the Refined Sphere Packing Bound Under Certain Symmetry Hypotheses”, Turk. J. Math., 44:3 (2020), 919–948  crossref  mathscinet  zmath  isi  scopus
    7. B. Nakiboğlu, “The Augustin capacity and center”, Problems Inform. Transmission, 55:4 (2019), 299–342  mathnet  crossref  crossref  isi  elib
    8. Cheng H.-Ch., Hsieh M.-H., Tomamichel M., “Quantum Sphere-Packing Bounds With Polynomial Prefactors”, IEEE Trans. Inf. Theory, 65:5 (2019), 2872–2898  crossref  mathscinet  zmath  isi  scopus
    9. Nakiboglu B., “the Sphere Packing Bound Via Augustin'S Method”, IEEE Trans. Inf. Theory, 65:2 (2019), 816–840  crossref  mathscinet  zmath  isi  scopus
    10. Yang W., Collins A., Durisi G., Polyanskiy Yu., Poor H.V., “Beta-Beta Bounds: Finite-Blocklength Analog of the Golden Formula”, IEEE Trans. Inf. Theory, 64:9 (2018), 6236–6256  crossref  mathscinet  zmath  isi  scopus
    11. Farkas L., Koi T., “Universal Random Access Error Exponents For Codebooks of Different Blocklengths”, IEEE Trans. Inf. Theory, 64:4, 1 (2018), 2240–2252  crossref  mathscinet  zmath  isi  scopus
    12. Dalai M. Winter A., “Constant Compositions in the Sphere Packing Bound For Classical-Quantum Channels”, IEEE Trans. Inf. Theory, 63:9 (2017), 5603–5617  crossref  isi
    13. Dalai M., “Some Remarks on Classical and Classical-Quantum Sphere Packing Bounds: Renyi Vs. Kullback-Leibler”, Entropy, 19:7 (2017), 355  crossref  isi
    14. Cheng H.-Ch. Hsieh M.-H. Tomamichel M., “Sphere-Packing Bound For Symmetric Classical-Quantum Channels”, 2017 IEEE International Symposium on Information Theory (ISIT), IEEE International Symposium on Information Theory, IEEE, 2017, 286–290  isi
    15. Cheng H.-Ch. Hsieh M.-H. Tomamichel M., “Sphere-Packing Bound For Classical-Quantum Channels”, 2017 IEEE Information Theory Workshop (Itw), Information Theory Workshop, IEEE, 2017, 479–483  isi
    16. Dalai M., “Lower Bounds on the Probability of Error for Classical and Classical-Quantum Channels”, IEEE Trans. Inf. Theory, 59:12 (2013), 8027–8056  crossref  isi  elib
    17. Verdu, S, “Fifty years of Shannon Theory”, IEEE Transactions on Information Theory, 44:6 (1998), 2057  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:506
    Full-text PDF :293
     
      Contact us:
    math-net2025_02@mi-ras.ru
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025