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, 1975, Volume 11, Issue 4, Pages 3–12 (Mi ppi1604)  

Information Theory

Shannon's Theorems for a Complete Class of Discrete Memoryless Channels Whose State is Known at the Output

S. Z. Stambler
Abstract: Coding theorems and their weak converse are proved for a complete class of discrete memoryless channels for ordinary and randomized codes with mean error, and also for randomized codes with maximum error under the assumption that the channel state is known at the output.
Received: 04.06.1974
Bibliographic databases:
Document Type: Article
UDC: 621.391.1
Language: Russian
Citation: S. Z. Stambler, “Shannon's Theorems for a Complete Class of Discrete Memoryless Channels Whose State is Known at the Output”, Probl. Peredachi Inf., 11:4 (1975), 3–12; Problems Inform. Transmission, 11:4 (1975), 263–270
Citation in format AMSBIB
\Bibitem{Sta75}
\by S.~Z.~Stambler
\paper Shannon's Theorems for a Complete Class of Discrete Memoryless Channels Whose State is Known at the Output
\jour Probl. Peredachi Inf.
\yr 1975
\vol 11
\issue 4
\pages 3--12
\mathnet{http://mi.mathnet.ru/ppi1604}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=479682}
\zmath{https://zbmath.org/?q=an:0357.94025}
\transl
\jour Problems Inform. Transmission
\yr 1975
\vol 11
\issue 4
\pages 263--270
Linking options:
  • https://www.mathnet.ru/eng/ppi1604
  • https://www.mathnet.ru/eng/ppi/v11/i4/p3
  • 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:271
    Full-text PDF :122
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024