Convergence and construction of minimal-cost infinite trees

Kin Man To; M. Golin

doi:10.1109/ISIT.1998.708830

Convergence and construction of minimal-cost infinite trees

The Hong Kong Polytechnic University

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-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 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	https://doi.org/10.1109/ISIT.1998.708830
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

More information

10.1109/ISIT.1998.708830

Cite this

@inproceedings{2fdffe5e65014266a0a0a16f06702baf,

title = "Convergence and construction of minimal-cost infinite trees",

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.",

author = "To, {Kin Man} and M. Golin",

year = "1998",

month = jan,

day = "1",

doi = "10.1109/ISIT.1998.708830",

language = "English",

isbn = "0780350006",

pages = "227",

booktitle = "Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998",

publisher = "IEEE",

address = "United States",

note = "1998 IEEE International Symposium on Information Theory, ISIT 1998 ; Conference date: 16-08-1998 Through 21-08-1998",

}

TY - GEN

T1 - Convergence and construction of minimal-cost infinite trees

AU - To, Kin Man

AU - Golin, M.

PY - 1998/1/1

Y1 - 1998/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84890355494&partnerID=8YFLogxK

U2 - 10.1109/ISIT.1998.708830

DO - 10.1109/ISIT.1998.708830

M3 - Conference article published in proceeding or book

SN - 0780350006

SN - 9780780350007

SP - 227

BT - Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998

PB - IEEE

T2 - 1998 IEEE International Symposium on Information Theory, ISIT 1998

Y2 - 16 August 1998 through 21 August 1998

ER -

Convergence and construction of minimal-cost infinite trees

Abstract

Conference

ASJC Scopus subject areas

More information

Other files and links

Cite this