Information-singularity and recoverability of random processes
暂无分享,去创建一个
[1] Robert M. Gray,et al. Mutual information rate, distortion, and quantization in metric spaces , 1980, IEEE Trans. Inf. Theory.
[2] H. Wilf,et al. Uniqueness theorems for periodic functions , 1965 .
[3] Robert S. Boyer,et al. A fast string searching algorithm , 1977, CACM.
[4] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.
[5] Bruce E. Hajek. On the strong information singularity of certain stationary processes (Corresp.) , 1979, IEEE Trans. Inf. Theory.
[6] L. Davisson,et al. The Distortion-Rate Function for Nonergodic Sources , 1978 .
[7] John C. Kieffer,et al. A unified approach to weak universal source coding , 1978, IEEE Trans. Inf. Theory.
[8] W. L. Root. Nonprobabilistic and Partly Probabilistic Channel Coding and Time Varying Channels , 1978 .
[9] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.
[10] Toby Berger. Information-singular random processes , 1975, IEEE Trans. Inf. Theory.
[11] David L. Neuhoff,et al. Fixed rate universal block source coding with a fidelity criterion , 1975, IEEE Trans. Inf. Theory.