On calculating the capacity of an infinite-input finite (infinite)-output channel
暂无分享,去创建一个
[1] Suguru Arimoto,et al. An algorithm for computing the capacity of arbitrary discrete memoryless channels , 1972, IEEE Trans. Inf. Theory.
[2] Alberto Leon-Garcia,et al. A source matching approach to finding minimax codes , 1980, IEEE Trans. Inf. Theory.
[3] Richard E. Blahut,et al. Computation of channel capacity and rate-distortion functions , 1972, IEEE Trans. Inf. Theory.
[4] D. Lee. On the source matching approach for Markov sources , 1983, IEEE Trans. Inf. Theory.
[5] Michael B. Pursley,et al. Efficient universal noiseless source codes , 1981, IEEE Trans. Inf. Theory.
[6] W. Nelson,et al. Minimax Solution of Statistical Decision Problems by Iteration , 1966 .