One-shot mutual covering lemma and Marton's inner bound with a common message

Jingbo Liu, Paul Cuff, Sergio Verdu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations

Abstract

By developing one-shot mutual covering lemmas, we derive a one-shot achievability bound for broadcast with a common message which recovers Marton's inner bound (with three auxiliary random variables) in the i.i.d. case. The encoder employed is deterministic. Relationship between the mutual covering lemma and a new type of channel resolvability problem is discussed.

Original languageEnglish (US)
Title of host publicationProceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1457-1461
Number of pages5
ISBN (Electronic)9781467377041
DOIs
StatePublished - Sep 28 2015
EventIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
Duration: Jun 14 2015Jun 19 2015

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2015-June
ISSN (Print)2157-8095

Other

OtherIEEE International Symposium on Information Theory, ISIT 2015
CountryHong Kong
CityHong Kong
Period6/14/156/19/15

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'One-shot mutual covering lemma and Marton's inner bound with a common message'. Together they form a unique fingerprint.

  • Cite this

    Liu, J., Cuff, P., & Verdu, S. (2015). One-shot mutual covering lemma and Marton's inner bound with a common message. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015 (pp. 1457-1461). [7282697] (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2015.7282697