Universal variable-to-fixed length source codes for Markov sources

K. Visweswariah, S. Kulkarni

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

A universal variable-to-fixed length code for the class of Markov sources with finite output alphabets is considered. The performance of the code for large dictionary sizes is investigated and it is shown that the code is optimal in the sense that no codes exist that have better asymptotic performance.

Original languageEnglish (US)
Title of host publicationProceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
Number of pages1
DOIs
StatePublished - Dec 1 1998
Event1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States
Duration: Aug 16 1998Aug 21 1998

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other1998 IEEE International Symposium on Information Theory, ISIT 1998
CountryUnited States
CityCambridge, MA
Period8/16/988/21/98

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Universal variable-to-fixed length source codes for Markov sources'. Together they form a unique fingerprint.

  • Cite this

    Visweswariah, K., & Kulkarni, S. (1998). Universal variable-to-fixed length source codes for Markov sources. In Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998 [708628] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.1998.708628