Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Achieving Capacity Region of 2-users Weak GIC by Enlarging the Core in a Nested Set of Polymatroids (continuation of arXiv:2012.07820 "Optimality of Gaussian in Enlarging HK Rate Region, and its Overlap with ...") (2101.00790v5)

Published 4 Jan 2021 in cs.IT, math.CO, and math.IT

Abstract: This article shows that achieving capacity region of a 2-users weak Gaussian Interference Channel (GIC) is equivalent to enlarging the core in a nested set of Polymatroids (each equivalent to capacity region of a multiple-access channel) through maximizing a minimum rate, then projecting along its orthogonal span and continuing recursively. This formulation relies on defining dummy private messages to capture the effect of interference in GIC. It follows that relying on independent Gaussian random code-books is optimum, and the corresponding solution corresponds to achieving the boundary in HK constraints.

Summary

We haven't generated a summary for this paper yet.