Average Redundancy of the Shannon Code for Markov Sources
暂无分享,去创建一个
[1] Jorma Rissanen,et al. Complexity of strings in the class of Markov sources , 1986, IEEE Trans. Inf. Theory.
[2] J. L. Hodges,et al. The Probability in the Extreme Tail of a Convolution , 1959 .
[3] Serap A. Savari,et al. Generalized Tunstall codes for sources with memory , 1997, IEEE Trans. Inf. Theory.
[4] Julia Abrahams,et al. Code and parse tree for lossless source encoding , 2001, Commun. Inf. Syst..
[5] Lauwerens Kuipers,et al. Uniform distribution of sequences , 1974 .
[6] Guy Louchard,et al. On the average redundancy rate of the Lempel-Ziv code , 1997, IEEE Trans. Inf. Theory.
[7] Philippe Jacquet,et al. Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source , 2001, Algorithmica.
[8] Ephraim Zehavi,et al. Decoding under integer metrics constraints , 1995, IEEE Trans. Commun..
[9] Wojciech Szpankowski,et al. Asymptotic average redundancy of Huffman (and other) block codes , 2000, IEEE Trans. Inf. Theory.
[10] Robert G. Gallager,et al. Variations on a theme by Huffman , 1978, IEEE Trans. Inf. Theory.
[11] Philippe Jacquet,et al. Joint String Complexity for Markov Sources , 2012 .
[12] Philippe Jacquet,et al. Markov types and minimax redundancy for Markov sources , 2004, IEEE Transactions on Information Theory.
[13] Neri Merhav. Relations Between Redundancy Patterns of the Shannon Code and Wave Diffraction Patterns of Partially Disordered Media , 2012, IEEE Trans. Inf. Theory.
[14] Wojciech Szpankowski,et al. Average Case Analysis of Algorithms on Sequences: Szpankowski/Average , 2001 .
[15] W. Szpankowski. Average Case Analysis of Algorithms on Sequences , 2001 .
[16] Serap A. Savari. Variable-to-fixed length codes for predictable sources , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).
[17] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .
[18] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[19] B. Sury. Weierstrass’s theorem — Leaving no ‘Stone’ unturned , 2011 .
[20] C. Esseen. Fourier analysis of distribution functions. A mathematical study of the Laplace-Gaussian law , 1945 .
[21] Michael Drmota,et al. Precise minimax redundancy and regret , 2004, IEEE Transactions on Information Theory.
[22] Robert M. Gray,et al. Quantization noise spectra , 1990, IEEE Trans. Inf. Theory.