The Arbitrarily Varying Broadcast Channel With Causal Side Information at the Encoder

2020 ◽  
Vol 66 (2) ◽  
pp. 757-779
Author(s):  
Uzi Pereg ◽  
Yossef Steinberg
2011 ◽  
Vol 58-60 ◽  
pp. 1572-1576
Author(s):  
Da Jin Wang ◽  
Guang Da Xue ◽  
Gui Liang Yan

We consider the problem of transmitting common message over discrete memoryless broadcast channel (DM-BC) with noncausal discrete memoryless (DM) channel side information (CSI) only known at encoder. Nayak, etc. consider this problem and give a scheme combining Wyner-Ziv coding and Gelfand-Pinsker coding. The Gelfand-Pinsker's code is optimal for point-to-point communication with the encoder accessed to noncausal CSI. But Nair, etc., show that the straightforward extension of Gelfand-Pinsker's code to DM-BC with DM state is not optimal. In this paper, the inner bound of transmitting common message over DM-BC with noncausal DM-CSI only known at encoder is given. The proof of achievability uses Wyner-Ziv coding, Gelfand-Pinsker coding, superposition coding, Marton coding and indirect decoding.


Sign in / Sign up

Export Citation Format

Share Document