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, 1982, Volume 18, Issue 1, Pages 12–26 (Mi ppi1211)  
This article is cited in 3 scientific papers (total in 3 papers)

Coding Theory

Random Coding Bounds for Discrete Memoryless Channels

G. Sh. Poltyrev
Full-text PDF (1440 kB) Citations (3)
Abstract: The article describes a new method of constructing random coding bounds in a discrete memoryless channel for an ensemble of codes with fixed composition and for an ensemble generated by an independent distribution at the channel input. This method makes it possible to construct upper bounds for different ensembles in unified fashion, and establishes a natural relationship between different points of representation of random coding bounds.
Received: 03.06.1980
Revised: 05.05.1981
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: G. Sh. Poltyrev, “Random Coding Bounds for Discrete Memoryless Channels”, Probl. Peredachi Inf., 18:1 (1982), 12–26; Problems Inform. Transmission, 18:1 (1982), 9–21
Citation in format AMSBIB
\Bibitem{Pol82}
\by G.~Sh.~Poltyrev
\paper Random Coding Bounds for Discrete Memoryless Channels
\jour Probl. Peredachi Inf.
\yr 1982
\vol 18
\issue 1
\pages 12--26
\mathnet{http://mi.mathnet.ru/ppi1211}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=689328}
\zmath{https://zbmath.org/?q=an:0493.94013}
\transl
\jour Problems Inform. Transmission
\yr 1982
\vol 18
\issue 1
\pages 9--21
Linking options:
  • https://www.mathnet.ru/eng/ppi1211
  • https://www.mathnet.ru/eng/ppi/v18/i1/p12
    • This publication is cited in the following 3 articles:
    1. Verdu S., “Error Exponents and Alpha-Mutual Information”, Entropy, 23:2 (2021), 199  crossref  mathscinet  isi  scopus
    2. B. Nakiboğlu, “The sphere packing bound for memoryless channels”, Problems Inform. Transmission, 56:3 (2020), 201–244  mathnet  crossref  crossref  isi  elib
    3. B. Nakiboğlu, “The Augustin capacity and center”, Problems Inform. Transmission, 55:4 (2019), 299–342  mathnet  crossref  crossref  isi  elib
    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:343
    Full-text PDF :199
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025