Convergence and construction of minimal-cost infinite trees

Kin Man To, M. Golin

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

1 Citation (Scopus)

Abstract

In this paper we introduce some new tools and techniques for the problem of finding minimum-cost prefix-free codes for infinite sources or, equivalently, finding minimum-cost infinite trees.
Original languageEnglish
Title of host publicationProceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
PublisherIEEE
Pages227
Number of pages1
ISBN (Print)0780350006, 9780780350007
DOIs
Publication statusPublished - 1 Jan 1998
Event1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States
Duration: 16 Aug 199821 Aug 1998

Conference

Conference1998 IEEE International Symposium on Information Theory, ISIT 1998
Country/TerritoryUnited States
CityCambridge, MA
Period16/08/9821/08/98

ASJC Scopus subject areas

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

Cite this