Universal coding with minimum probability of codeword length overflow
暂无分享,去创建一个
[1] Michael Gutman,et al. Asymptotically optimal classification for multiple tests with empirically observed statistics , 1989, IEEE Trans. Inf. Theory.
[2] Pierre A. Humblet. Generalization of Huffman coding to minimize the probability of buffer overflow , 1981, IEEE Trans. Inf. Theory.
[3] Robert J. McEliece,et al. The Theory of Information and Coding , 1979 .
[4] A. Wyner. On the Probability of Buffer Overflow Under an Arbitrary Bounded Input-Output Distribution , 1974 .
[5] Robert B. Ash,et al. Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.
[6] Thomas M. Cover,et al. On the competitive optimality of Huffman codes , 1991, IEEE Trans. Inf. Theory.
[7] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.
[8] Marcelo J. Weinberger,et al. Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm , 1992, IEEE Trans. Inf. Theory.
[9] Neri Merhav,et al. Estimating the number of states of a finite-state source , 1992, IEEE Trans. Inf. Theory.
[10] Jorma Rissanen,et al. Universal coding, information, prediction, and estimation , 1984, IEEE Trans. Inf. Theory.
[11] I. Csiszár. Information Theory , 1981 .
[12] Katalin Marton,et al. Error exponent for source coding with a fidelity criterion , 1974, IEEE Trans. Inf. Theory.
[13] Frederick Jelinek,et al. On variable-length-to-block coding , 1972, IEEE Trans. Inf. Theory.
[14] Lee D. Davisson,et al. Universal noiseless coding , 1973, IEEE Trans. Inf. Theory.
[15] Frederick Jelinek,et al. Buffer overflow in variable length coding of fixed rate sources , 1968, IEEE Trans. Inf. Theory.