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, 2020, Volume 56, Issue 3, Pages 3–49
DOI: https://doi.org/10.31857/S0555292320030018
(Mi ppi2319)
 

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

Information Theory

The sphere packing bound for memoryless channels

B. Nakiboğlu

Middle East Technical University, Ankara, Turkey
References:
Abstract: Sphere packing bounds (SPBs)—with prefactors that are polynomial in the block length—are derived for codes on two families of memoryless channels using Augustin’s method: (possibly nonstationary) memoryless channels with (possibly multiple) additive cost constraints and stationary memoryless channels with convex constraints on the composition (i.e., empirical distribution, type) of the input codewords. A variant of Gallager’s bound is derived in order to show that these sphere packing bounds are tight in terms of the exponential decay rate of the error probability with the block length under mild hypotheses.
Keywords: Augustin’s method, sphere packing exponent, error exponent, reliability function, memoryless channels, Gaussian channels, Poisson channels.
Received: 18.04.2018
Revised: 06.03.2020
Accepted: 29.04.2020
English version:
Problems of Information Transmission, 2020, Volume 56, Issue 3, Pages 201–244
DOI: https://doi.org/10.1134/S0032946020030011
Bibliographic databases:
Document Type: Article
UDC: 621.391.1 : 519.72
Language: Russian
Citation: B. Nakiboğlu, “The sphere packing bound for memoryless channels”, Probl. Peredachi Inf., 56:3 (2020), 3–49; Problems Inform. Transmission, 56:3 (2020), 201–244
Citation in format AMSBIB
\Bibitem{Nak20}
\by B.~Nakibo{\u g}lu
\paper The sphere packing bound for memoryless channels
\jour Probl. Peredachi Inf.
\yr 2020
\vol 56
\issue 3
\pages 3--49
\mathnet{http://mi.mathnet.ru/ppi2319}
\crossref{https://doi.org/10.31857/S0555292320030018}
\elib{https://elibrary.ru/item.asp?id=45248018}
\transl
\jour Problems Inform. Transmission
\yr 2020
\vol 56
\issue 3
\pages 201--244
\crossref{https://doi.org/10.1134/S0032946020030011}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000579453900001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85092770924}
Linking options:
  • https://www.mathnet.ru/eng/ppi2319
  • https://www.mathnet.ru/eng/ppi/v56/i3/p3
  • This publication is cited in the following 12 articles:
    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:180
    Full-text PDF :20
    References:28
    First page:16
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024