A general approach to random coding for multi-terminal networks

Stefano Rini, Andrea Goldsmith

研究成果同行評審

14 引文 斯高帕斯(Scopus)

摘要

We introduce a general framework to derive achievable rate regions based on random coding for any memoryless, single-hop, multi-terminal network. We show that this general inner bound may be obtained from a graph representation that captures the statistical relationship among codewords and allows one to readily obtain the rate bounds under which the error probability vanishes as the block-length goes to infinity. The proposed graph representation naturally leads to an "automatic rate region derivator" which produces achievable rate regions combining classic random coding techniques such as coded timesharing, rate-splitting, superposition coding and binning for the general memoryless network under consideration.

原文English
頁面335-343
頁數9
DOIs
出版狀態Published - 16 5月 2013
事件2013 Information Theory and Applications Workshop, ITA 2013 - San Diego, CA, 美國
持續時間: 10 2月 201315 2月 2013

Conference

Conference2013 Information Theory and Applications Workshop, ITA 2013
國家/地區美國
城市San Diego, CA
期間10/02/1315/02/13

指紋

深入研究「A general approach to random coding for multi-terminal networks」主題。共同形成了獨特的指紋。

引用此