Shaping-loss conjecture for the Gaussian doubly-dirty MAC
Statement
Let the Gaussian doubly-dirty multiple access channel have high signal-to-noise ratio and strong interference. Denote its sum capacity by and the sum rate of the best known single-letter characterization by , as defined by the corresponding single-letter region. Shaping-loss conjecture. For the Gaussian doubly-dirty MAC, the best known single-letter expression has sum-rate loss
with respect to the sum capacity. This conjecture concerns whether single-letter random-coding characterizations incur the familiar shaping loss; the paper provides a partial proof, while the optimization needed for a complete proof remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.