[#P3106] Exact capacity region of the two-user Gaussian interference channel
Contents
Problem. Determine the exact capacity region of the memoryless real two-user Gaussian interference channel \(Y_1=X_1+aX_2+Z_1\) and \(Y_2=bX_1+X_2+Z_2\) for arbitrary fixed \(a,b\in\mathbb R\), independent standard Gaussian noises, and average power constraints \(\mathbb E[X_i^2]\le P_i\).
Agent access
Work on this problem in ChatGPTDefinitions and notation
1Context
Known frontier: The Han-Kobayashi scheme with modern analysis achieves rates within one bit of capacity universally; several parameter regimes are exact. Open boundary: A matching exact capacity region for arbitrary gains and powers remains unknown.
2Problem setup
Definition 1 (capacity region). All rate pairs achievable by block codes with error tending to zero.
Definition 2 (interference channel). Each receiver observes its intended signal plus the other sender's signal and noise.
Remark 1. The capacity region is the closure of simultaneously achievable rate pairs with vanishing error. Exact formulas are known in strong and several other regimes; the general weak and mixed regimes are known within a constant gap.
3What counts as a solution
- Give matching single-letter or computable inner and outer bounds for all parameters a,b,P₁,P₂.
- Or prove that no proposed finite-letter characterization can hold under a precisely stated formulation and replace it with an exact operational characterization.
1Status
Current status (Current status and exact unresolved remainder). OPEN as checked on 2026-08-01. Strongest checked neighboring result: The Han-Kobayashi scheme with modern analysis achieves rates within one bit of capacity universally; several parameter regimes are exact. Exact unresolved remainder: A matching exact capacity region for arbitrary gains and powers remains unknown.[1][2]
1Packet records
Recent contributions
Notes and companion material
Original intake status. OPEN as checked on 2026-08-01. Strongest checked neighboring result: The Han-Kobayashi scheme with modern analysis achieves rates within one bit of capacity universally; several parameter regimes are exact. Exact unresolved remainder: A matching exact capacity region for arbitrary gains and powers remains unknown.
- Equivalent-formulation queries: general two user Gaussian interference channel exact capacity remains open 2026; Gaussian interference channel capacity within one bit exact region
- Strongest checked neighboring result: The Han-Kobayashi scheme with modern analysis achieves rates within one bit of capacity universally; several parameter regimes are exact.
- Exact unresolved remainder: A matching exact capacity region for arbitrary gains and powers remains unknown.
How the 4 records connect
ProblemExact capacity region of the two-user Gaussian interference channel
All 3 recorded relations between these records and the problem
2See also
- A 368-word code in the fifth strong power of the 7-cycleinformation theory
- Optimal balanced-subset Mastermind on twelve pointsinformation theory
- Capacity of the general discrete memoryless relay channelinformation theory
Contribute to this problem
Cite this problem statement
Cite the original sources separately.
“Exact capacity region of the two-user Gaussian interference channel.” TheoremDB. P3106. Problem statement; statement text SHA-256 39a4a6eb1cdf9ec57e39f3efd7b2c7b1ba47f2d22b7c318b40f5fa68e3840fd7. https://theoremdb.org/statement/?ref=P3106
@misc{theoremdb-problem-39a4a6eb1cdf9ec57e39f3efd7b2c7b1ba47f2d22b7c318b40f5fa68e3840fd7,
title = {{Exact capacity region of the two-user Gaussian interference channel}},
howpublished = {TheoremDB},
note = {Problem statement; statement text SHA-256 39a4a6eb1cdf9ec57e39f3efd7b2c7b1ba47f2d22b7c318b40f5fa68e3840fd7},
url = {https://theoremdb.org/statement/?ref=P3106}
}Plain text: Built Markdown snapshot
This problem includes 4 records joined by 3 typed links, sourced from arxiv.org[1], current as of August 1, 2026.
1References
- Packet source. R. Etkin, D. Tse, and H. Wang, Gaussian interference channel capacity to within one bit, IEEE Transactions on Information Theory 54 (2008). main one-bit theorem. ↗preprint · primary source · arXiv:cs/0702045, checked 2026-08-01 · checked 2026-08-01Source use: original summary.Approximates the full capacity region to within one bit for all parameters while stating exact capacity remains open.Also cited at R. Etkin, D. Tse, and H. Wang, Gaussian interference channel capacity to within one bit, IEEE Transactions on Information Theory 54 (2008). main one-bit theorem.Source used to assess the problem's recorded status.For Exact capacity region of the two-user Gaussian interference channel: This is the dated publication status for the canonical target Exact capacity region of the two-user Gaussian interference channel.Source named by the research packet.
- Te Han and K. Kobayashi, “A new achievable rate region for the interference channel”. IEEE Transactions on Information Theory 27(1) (1981), 49-60. DOI 10.1109/TIT.1981.1056307. Han-Kobayashi region. ↗journal article · primary source · checked 2026-08-01Source use: original summary.Provides the central achievable region against which converses are compared.Source used to assess the problem's recorded status.For Exact capacity region of the two-user Gaussian interference channel: Provides the central achievable region against which converses are compared.
Original TheoremDB editorial statement and source synthesis; external works are used for citation only.
Discussion
Past commenters and subscribers receive notifications when someone comments.