Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources
J Ziv - IEEE transactions on information theory, 1990 - ieeexplore.ieee.org
It is demonstrated that for finite-alphabet, kth-order ergodic Markov sources (ie memory of k
letters), a variable-to-fixed length code is better than the best fixed-to-variable length code
(Huffman code). It is shown how to construct a variable-to-fixed length code for a kth order
ergodic Markov source, which compresses more effectively than the best fixed-to-variable
code.<>
letters), a variable-to-fixed length code is better than the best fixed-to-variable length code
(Huffman code). It is shown how to construct a variable-to-fixed length code for a kth order
ergodic Markov source, which compresses more effectively than the best fixed-to-variable
code.<>
Showing the best result for this search. See all results
