TY - GEN
T1 - Average redundancy of the Shannon code for Markov sources
AU - Merhav, Neri
AU - Szpankowski, Wojciech
PY - 2013
Y1 - 2013
N2 - It is known that for memoryless sources, the average and maximal redundancy of fixed-to-variable length codes, such as the Shannon and Huffman codes, exhibit two modes of behavior for long blocks. It either converges to a limit or it has an oscillatory pattern, depending on the irrationality or rationality, respectively, of certain parameters that depend on the source. Here, we extend these findings for the Shannon code to the case of a Markov source, which is considerably more involved. We provide a precise characterization of the redundancy of the Shannon code redundancy for a class of irreducible, periodic and aperiodic Markov sources.
AB - It is known that for memoryless sources, the average and maximal redundancy of fixed-to-variable length codes, such as the Shannon and Huffman codes, exhibit two modes of behavior for long blocks. It either converges to a limit or it has an oscillatory pattern, depending on the irrationality or rationality, respectively, of certain parameters that depend on the source. Here, we extend these findings for the Shannon code to the case of a Markov source, which is considerably more involved. We provide a precise characterization of the redundancy of the Shannon code redundancy for a class of irreducible, periodic and aperiodic Markov sources.
UR - http://www.scopus.com/inward/record.url?scp=84890353751&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2013.6620560
DO - 10.1109/ISIT.2013.6620560
M3 - منشور من مؤتمر
SN - 9781479904464
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1919
EP - 1923
BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013
T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013
Y2 - 7 July 2013 through 12 July 2013
ER -