15 problems
The capacity-region claim. The capacity region of the -user linear deterministic broadcast channel for this diamond message set is the set of non-negative rate tuples satisfying…
Let denote the proportional fair capacity of a Gaussian broadcast channel with noise vector and total power . Let denote the co…
Consider a two-receiver memoryless broadcast channel with states and receiver message side information (RMSI), together with the corresponding channel without RMSI. Let a transmiss…
Consider a private-message AWGN broadcast channel with receivers, ordered by noise levels as . A group leader is the common subgraph obtained f…
Binary-alphabet concave-envelope conjecture. For all and all such Markov chains,
Generalized factorization conjecture. For all product channels, all , all , and all ,
Factorization conjecture. For all product channels, all , and all ,
Let and denote the channel covariance matrices, let be the signal-to-noise ratio, and let be the weighted ergodic…
Let and denote the channel covariance matrices, let be the signal-to-noise ratio, and let and ma…
Convexity conjecture. For the degraded CMLOBCs described above, the capacity region is strictly concave () if and only if
Let a broadcast relay channel with common relay have input alphabets represented by and output alphabets . In the degraded case, the channel satisfies…
We consider the binary skew-symmetric broadcast channel with input and outputs . Let be random variables such that … forms a Markov chain. Nair–Wang information…
Let be the alphabet size of the channel input, and let be the alphabet size of the code for User 2 in a permutation encoding approach. For an input-symmetric degraded bro…
Let be auxiliary random variables and let be the input and outputs of the binary skew-symmetric channel with , such that…
DPC optimality conjecture. If the decoders are ordered such that