On capacity computation for the two-user binary multiple-access channel: Solutions by cooperation
暂无分享,去创建一个
[1] Jacob Wolfowitz,et al. Multiple Access Channels , 1978 .
[2] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[3] Yoichiro Watanabe. The total capacity of two-user multiple-access channel with binary output , 1996, IEEE Trans. Inf. Theory.
[4] K. Kamoi,et al. The total capacity of multiple-access channel , 2002, Proceedings IEEE International Symposium on Information Theory,.
[5] Richard E. Blahut,et al. Computation of channel capacity and rate-distortion functions , 1972, IEEE Trans. Inf. Theory.
[6] Suguru Arimoto,et al. An algorithm for computing the capacity of arbitrary discrete memoryless channels , 1972, IEEE Trans. Inf. Theory.
[7] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[8] R. Gallager. Information Theory and Reliable Communication , 1968 .
[9] Rudolf Ahlswede,et al. Multi-way communication channels , 1973 .
[10] Daniel Pérez Palomar,et al. The Computation of the Capacity Region of the Discrete MAC is a Rank-One Non-Convex Optimization Problem , 2007, 2007 IEEE International Symposium on Information Theory.
[11] Gerhard Wunder,et al. On Capacity Computation for the Two-User Binary Multiple-Access Channel , 2009, ArXiv.
[12] Alex J. Grant,et al. Computation of total capacity for discrete memoryless multiple-access channels , 2004, IEEE Transactions on Information Theory.
[13] Yoichiro Watanabe,et al. A Formulation of the Channel Capacity of Multiple-Access Channel , 2009, IEEE Transactions on Information Theory.
[14] Yoichiro Watanabe,et al. Channel configuration of multiple-access channel , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..