摘要
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月 2013 → 15 2月 2013 |
Conference
Conference | 2013 Information Theory and Applications Workshop, ITA 2013 |
---|---|
國家/地區 | 美國 |
城市 | San Diego, CA |
期間 | 10/02/13 → 15/02/13 |