Channel Codes for Relayless Networks with General Message Access Structure
Jun Muramatsu
TL;DR
This paper introduces a new class of channel codes for relayless networks with complex message access, demonstrating their ability to achieve the network's capacity region characterized by entropy functions, offering an alternative to existing regions.
Contribution
It presents a novel coding scheme for relayless networks with general message access structures, achieving the multi-letter capacity region characterized by entropy functions.
Findings
The proposed codes achieve the network's capacity region.
The capacity region is characterized in terms of entropy functions.
Provides an alternative to existing capacity region characterizations.
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].
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Cellular Automata and Applications · Wireless Communication Security Techniques