2000 character limit reached
New Strong Converse for Asymmetric Broadcast Channels
Published 11 Apr 2016 in cs.IT and math.IT | (1604.02901v4)
Abstract: We consider the discrete memoryless asymmetric broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent function. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem.
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.