Bounded-loss conjecture for single-letter solutions in multi-terminal AWGN networks
Statement
A multi-terminal AWGN information network is a network whose communication channels are additive white Gaussian noise channels; an achievable single-letter solution is a single-letter characterization or scheme that attains an achievable operating point, and the optimal solution is the best achievable operating point for the network. The SNR is the signal-to-noise ratio.
Bounded-loss conjecture. For any multi-terminal AWGN information network, an achievable single-letter solution is within a bounded distance from the optimal solution, regardless of the SNR value.
This conjecture proposes that single-letter methods approximate optimal performance uniformly over signal-to-noise ratios in multi-terminal Gaussian networks. The source provides no resolution or quantitative specification of the bound, so the conjecture 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.