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 language | English |
---|---|
Title of host publication | Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998 |
Publisher | IEEE |
Pages | 227 |
Number of pages | 1 |
ISBN (Print) | 0780350006, 9780780350007 |
DOIs | |
Publication status | Published - 1 Jan 1998 |
Event | 1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States Duration: 16 Aug 1998 → 21 Aug 1998 |
Conference
Conference | 1998 IEEE International Symposium on Information Theory, ISIT 1998 |
---|---|
Country/Territory | United States |
City | Cambridge, MA |
Period | 16/08/98 → 21/08/98 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics