One-Shot Mutual Covering Lemma and Marton's Inner Bound with a Common Message
Information Theory
2015-12-01 v3 math.IT
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.
Keywords
Cite
@article{arxiv.1504.04092,
title = {One-Shot Mutual Covering Lemma and Marton's Inner Bound with a Common Message},
author = {Jingbo Liu and Paul Cuff and Sergio Verdu},
journal= {arXiv preprint arXiv:1504.04092},
year = {2015}
}
Comments
6 pages; extended version of ISIT paper