Channel Codes for Relayless Networks with General Message Access Structure
Information Theory
2023-03-21 v2 math.IT
Abstract
Channel codes for relayless networks with the general message access structure is introduced. It is shown that the multi-letter characterized capacity region of this network is achievable with this code. The capacity region is characterized in terms of entropy functions and provides an alternative to the regions introduced by [Somekh-Baruch and Verd\'u, ISIT2006][Muramatsu and Miyake, ISITA2018].
Keywords
Cite
@article{arxiv.2206.00792,
title = {Channel Codes for Relayless Networks with General Message Access Structure},
author = {Jun Muramatsu},
journal= {arXiv preprint arXiv:2206.00792},
year = {2023}
}
Comments
(v1) 26 pages, to submitted to IEEE ITW2023, (v2) 27 pages, Remark 1 and Lemma 9 in v1 is deleted, Lemma 7 in v2 is added, Eq. (13) and the proof of Lemma 7 in v1 (Eq. (14) and the proof of Lemma 8 in v2) are revised