Cut-set Theorems for Multi-state Networks
暂无分享,去创建一个
[1] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.
[2] Michael Gastpar,et al. On the capacity of wireless networks: the relay case , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[3] Ashutosh Sabharwal,et al. On capacity of Gaussian 'cheap' relay channel , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).
[4] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[5] Abbas El Gamal,et al. Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.
[6] J. Wolfowitz. Coding Theorems of Information Theory , 1962, Ergebnisse der Mathematik und Ihrer Grenzgebiete.
[7] Ashutosh Sabharwal,et al. Network Channel Estimation in Cooperative Wireless Networks , 2003 .
[8] Ashutosh Sabharwal,et al. On the Capacity of 'Cheap' Relay Networks , 2003 .
[9] Ashutosh Sabharwal,et al. Achievable Rates for Arbitrary Network Topologies with â Cheapâ Nodes , 2003 .
[10] Mohammad Ali Khojastepour,et al. The capacity of average and peak power constrained fading channels with channel side information , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).
[11] Anthony Ephremides,et al. Information Theory and Communication Networks: An Unconsummated Union , 1998, IEEE Trans. Inf. Theory.
[12] Pravin Varaiya,et al. Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.
[13] R. Gallager,et al. The Gaussian parallel relay network , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).