Communication With Disturbance Constraints
From MaRDI portal
Publication:2986197
DOI10.1109/TIT.2014.2322852zbMATH Open1360.94011arXiv1103.0996MaRDI QIDQ2986197FDOQ2986197
Authors:
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Motivated by the broadcast view of the interference channel, the new problem of communication with disturbance constraints is formulated. The rate-disturbance region is established for the single constraint case and the optimal encoding scheme turns out to be the same as the Han-Kobayashi scheme for the two user-pair interference channel. This result is extended to the Gaussian vector (MIMO) case. For the case of communication with two disturbance constraints, inner and outer bounds on the rate-disturbance region for a deterministic model are established. The inner bound is achieved by an encoding scheme that involves rate splitting, Marton coding, and superposition coding, and is shown to be optimal in several nontrivial cases. This encoding scheme can be readily applied to discrete memoryless interference channels and motivates a natural extension of the Han-Kobayashi scheme to more than two user pairs.
Full work available at URL: https://arxiv.org/abs/1103.0996
Recommendations
- Simultaneous Communication in Noisy Channels
- Communication with partial noiseless feedback
- Interactive communication with unknown noise rate
- Interactive communication with unknown noise rate
- Control Under Communication Constraints
- Communication over fading channels with delay constraints
- Reliable communication under channel uncertainty
- Control-Theoretic Approach to Communication With Feedback
- Discrete communication systems
Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40)
Cited In (3)
This page was built for publication: Communication With Disturbance Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986197)