Two Lower Bounds on the Secrecy Capacity of the Action-dependent Dirty Paper Wiretap Channel.
Linman YuZhuojun ZhuangZheng MaBin DaiPublished in: IWSDA (2019)
Keyphrases
- lower bound
- channel capacity
- upper bound
- branch and bound
- branch and bound algorithm
- objective function
- np hard
- lower and upper bounds
- multi channel
- worst case
- human actions
- upper and lower bounds
- reinforcement learning
- lagrangian relaxation
- communication channels
- action selection
- key distribution
- high capacity
- data structure
- min sum