2000 character limit reached
A New Sum-Rate Outer Bound for Interference Channels with Three Source-Destination Pairs
Published 3 Feb 2011 in cs.IT and math.IT | (1102.0690v1)
Abstract: This paper derives a novel sum-rate outer bound for the general memoryless interference channel with three users. The derivation is a generalization of the techniques developed by Kramer and by Etkin et al for the Gaussian two-user channel. For the three-user Gaussian channel the proposed sum-rate outer bound outperforms known bounds for certain channel parameters.
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.