An Upper Bound on the Capacity of the Causal Dirty-Paper Channel.
Mustafa KesalUri ErezPublished in: IEEE Trans. Inf. Theory (2011)
Keyphrases
- upper bound
- lower bound
- channel capacity
- worst case
- branch and bound algorithm
- lower and upper bounds
- multi channel
- causal models
- channel state information
- bayesian networks
- causal relationships
- causal networks
- multiple access
- search algorithm
- directed acyclic graph
- communication channels
- branch and bound
- fading channels
- wireless link
- causal independence
- np hard