Achievable Rate Regions for Discrete Memoryless Interference Channel with State Information
暂无分享,去创建一个
[1] Yi Cao,et al. An Achievable Rate Region for Interference Channels with Conferencing , 2007, 2007 IEEE International Symposium on Information Theory.
[2] Te Sun Han,et al. A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.
[3] Yossef Steinberg,et al. Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information , 2005, IEEE Transactions on Information Theory.
[4] Claude E. Shannon,et al. Channels with Side Information at the Transmitter , 1958, IBM J. Res. Dev..
[5] Hiroshi Sato,et al. The capacity of the Gaussian interference channel under strong interference , 1981, IEEE Trans. Inf. Theory.
[6] Young-Han Kim,et al. Multiple user writing on dirty paper , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[7] Kingo Kobayashi. A Further Consideration on the HK and the CMG regions for the Interference Channel , 2007 .
[8] R. Ahlswede. The Capacity Region of a Channel with Two Senders and Two Receivers , 1974 .
[9] Abbas El Gamal,et al. On the capacity of computer memory with defects , 1983, IEEE Trans. Inf. Theory.
[10] Aydano B. Carleial,et al. Interference channels , 1978, IEEE Trans. Inf. Theory.
[11] Ahmed H. Tewfik,et al. Multimedia data-embedding and watermarking technologies , 1998, Proc. IEEE.
[12] Max H. M. Costa,et al. Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.
[13] Aydano B. Carleial,et al. A case where interference does not reduce capacity (Corresp.) , 1975, IEEE Trans. Inf. Theory.
[14] Jinhua Jiang,et al. Discrete Memoryless Interference Channels with Fee back , 2007, 2007 41st Annual Conference on Information Sciences and Systems.
[15] Mehul Motani,et al. On The Han–Kobayashi Region for theInterference Channel , 2008, IEEE Transactions on Information Theory.
[16] Claude E. Shannon,et al. Two-way Communication Channels , 1961 .