2000 character limit reached
Semi-Robust Communications over a Broadcast Channel
Published 2 Nov 2017 in cs.IT and math.IT | (1711.00657v2)
Abstract: We establish the deterministic-code capacity region of a network with one transmitter and two receivers: an "ordinary receiver" and a "robust receiver." The channel to the ordinary receiver is a given (known) discrete memoryless channel (DMC), whereas the channel to the robust receiver is an arbitrarily varying channel (AVC). Both receivers are required to decode the "common message," whereas only the ordinary receiver is required to decode the "private message."
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.