Gaussian Interference Channel with State Information
暂无分享,去创建一个
[1] Igal Sason,et al. On achievable rate regions for the Gaussian interference channel , 2004, IEEE Transactions on Information Theory.
[2] Abbas El Gamal,et al. On the capacity of computer memory with defects , 1983, IEEE Trans. Inf. Theory.
[3] Max H. M. Costa,et al. Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.
[4] Aydano B. Carleial,et al. A case where interference does not reduce capacity (Corresp.) , 1975, IEEE Trans. Inf. Theory.
[5] Mehul Motani,et al. On The Han–Kobayashi Region for theInterference Channel , 2008, IEEE Transactions on Information Theory.
[6] Hiroshi Sato,et al. The capacity of the Gaussian interference channel under strong interference , 1981, IEEE Trans. Inf. Theory.
[7] 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.
[8] Hua Wang,et al. Gaussian Interference Channel Capacity to Within One Bit , 2007, IEEE Transactions on Information Theory.
[9] Te Sun Han,et al. A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.
[10] Kingo Kobayashi. A Further Consideration on the HK and the CMG regions for the Interference Channel , 2007 .
[11] Young-Han Kim,et al. Multiple user writing on dirty paper , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[12] J. Nicholas Laneman,et al. Multiaccess Channels with State Known to Some Encoders and Independent Messages , 2008, EURASIP J. Wirel. Commun. Netw..
[13] Lili Zhang,et al. Achievable Rate Regions for Discrete Memoryless Interference Channel with State Information , 2010, 2011 IEEE International Conference on Communications (ICC).
[14] Ahmed H. Tewfik,et al. Multimedia data-embedding and watermarking technologies , 1998, Proc. IEEE.