Approximate Capacity of the Dirty Multiple-Access Channel With Partial State Information at the Encoders
暂无分享,去创建一个
[1] Luc Vandendorpe,et al. Multiaccess channels with state known to one encoder: Another case of degraded message sets , 2009, 2009 IEEE International Symposium on Information Theory.
[2] Shlomo Shamai,et al. Capacity and lattice strategies for canceling known interference , 2005, IEEE Transactions on Information Theory.
[3] J. Nicholas Laneman,et al. Multiaccess Channels with State Known to Some Encoders and Independent Messages , 2008, EURASIP J. Wirel. Commun. Netw..
[4] Shlomo Shamai,et al. Cooperative Multiple-Access Encoding With States Available at One Transmitter , 2008, IEEE Transactions on Information Theory.
[5] Max H. M. Costa,et al. Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.
[6] Ram Zamir,et al. On the Loss of Single-Letter Characterization: The Dirty Multiple Access Channel , 2009, IEEE Transactions on Information Theory.
[7] Meir Feder,et al. On lattice quantization noise , 1996, IEEE Trans. Inf. Theory.
[8] R. Zamir,et al. A modulo-lattice transformation for multiple-access channels , 2008, 2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel.
[9] Shlomo Shamai,et al. Cooperative Multiple-Access Encoding With States Available at One Transmitter , 2008, IEEE Trans. Inf. Theory.
[10] I-Hsiang Wang. Distributed Interference Cancellation in Multiple Access Channels , 2010, ArXiv.
[11] Uri Erez,et al. Lattice Strategies for the Dirty Multiple Access Channel , 2007, IEEE Transactions on Information Theory.
[12] Young-Han Kim,et al. Multiple user writing on dirty paper , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..