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, 2018, Volume 54, Issue 3, Pages 3–35 (Mi ppi2270)  

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

Information Theory

Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior

H. Bochea, R. F. Schaeferb, H. V. Poorc

a Institute of Theoretical Information Technology, Technische Universität München, Munich, Germany
b Information Theory and Applications Chair, Technische Universität Berlin, Berlin, Germany
c Department of Electrical Engineering, Princeton University, Princeton, USA
Full-text PDF (366 kB) Citations (6)
References:
Abstract: The common wisdom is that the capacity of parallel channels is usually additive. This was also conjectured by Shannon for the zero-error capacity function, which was later disproved by constructing explicit counterexamples demonstrating the zero-error capacity to be super-additive. Despite these explicit examples for the zero-error capacity, there is surprisingly little known for nontrivial channels. This paper addresses this question for the arbitrarily varying channel (AVC) under list decoding by developing a complete theory. The list capacity function is studied and shown to be discontinuous, and the corresponding discontinuity points are characterized for all possible list sizes. For parallel AVCs it is then shown that the list capacity is super-additive, implying that joint encoding and decoding for two parallel AVCs can yield a larger list capacity than independent processing of both channels. This discrepancy is shown to be arbitrarily large. Furthermore, the developed theory is applied to the arbitrarily varying wiretap channel to address the scenario of secure communication over AVCs.
Funding agency Grant number
Deutsche Forschungsgemeinschaft BO 1734/20-1
National Science Foundation CMMI-1435778
ECCS-1647198
This research was supported in part by the German Research Foundation (DFG) under Grant BO 1734/20-1 and in part by the U.S. National Science Foundation under Grants CMMI-1435778 and ECCS-1647198.
Received: 24.09.2017
Revised: 16.04.2018
English version:
Problems of Information Transmission, 2018, Volume 54, Issue 3, Pages 199–228
DOI: https://doi.org/10.1134/S0032946018030018
Bibliographic databases:
Document Type: Article
UDC: 621.391.1:519.2
Language: Russian
Citation: H. Boche, R. F. Schaefer, H. V. Poor, “Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior”, Probl. Peredachi Inf., 54:3 (2018), 3–35; Problems Inform. Transmission, 54:3 (2018), 199–228
Citation in format AMSBIB
\Bibitem{BocSchPoo18}
\by H.~Boche, R.~F.~Schaefer, H.~V.~Poor
\paper Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior
\jour Probl. Peredachi Inf.
\yr 2018
\vol 54
\issue 3
\pages 3--35
\mathnet{http://mi.mathnet.ru/ppi2270}
\transl
\jour Problems Inform. Transmission
\yr 2018
\vol 54
\issue 3
\pages 199--228
\crossref{https://doi.org/10.1134/S0032946018030018}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000448436900001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85054829588}
Linking options:
  • https://www.mathnet.ru/eng/ppi2270
  • https://www.mathnet.ru/eng/ppi/v54/i3/p3
  • This publication is cited in the following 6 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024