Short message noisy network coding for multiple sources
暂无分享,去创建一个
[1] Gerhard Kramer,et al. The multicast capacity of deterministic relay networks with no interference , 2006, IEEE Transactions on Information Theory.
[2] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[3] Gerhard Kramer,et al. On message lengths for noisy network coding , 2011, 2011 IEEE Information Theory Workshop.
[4] Babak Hassibi,et al. Capacity of wireless erasure networks , 2006, IEEE Transactions on Information Theory.
[5] Sae-Young Chung,et al. Noisy Network Coding , 2010, IEEE Transactions on Information Theory.
[6] Michael Gastpar,et al. Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.
[7] Thomas M. Cover,et al. Network Information Theory , 2001 .
[8] Suhas N. Diggavi,et al. Wireless Network Information Flow: A Deterministic Approach , 2009, IEEE Transactions on Information Theory.
[9] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[10] Gerhard Kramer,et al. Short-message quantize-forward network coding , 2011, 2011 8th International Workshop on Multi-Carrier Systems & Solutions.
[11] Ahmad Abu Al Haija,et al. On Compress-Forward without Wyner-Ziv Binning for Relay Networks , 2011, ArXiv.
[12] Abbas El Gamal,et al. Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).
[13] Xiugang Wu,et al. On the Optimal Compressions in the Compress-and-Forward Relay Schemes , 2010, IEEE Transactions on Information Theory.