2 problems

Matching

Deterministic approximation conjecture for Nakagami fading channels
Deterministic approximation conjecture. If $h$ has a Nakagami- $m$ distribution with $m \geq 3$ , then the fading channel can be well approximated by a deterministic channel gain wit…
openfading-channels interference-models wireless-networks
04
DPC optimality conjecture for the K-user quasi-static fading broadcast channel
DPC optimality conjecture. If the $K$ decoders are ordered such that
openbroadcast-channels fading-channels information-theory
05

Deterministic approximation conjecture for Nakagami fading channels