A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes

Sze Lok Chan, M. Golin

Research output: Chapter in Book/Conference Proceeding/ReportConference Paper published in a bookpeer-review

Abstract

We discuss the problem of efficiently constructing minimum-cost binary prefix-free codes having the property that each codeword ends with a «1».

Original languageEnglish
Title of host publicationProceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages45
Number of pages1
ISBN (Print)0780350006, 9780780350007
DOIs
Publication statusPublished - 1998
Event1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States
Duration: 16 Aug 199821 Aug 1998

Publication series

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

Conference

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

Fingerprint

Dive into the research topics of 'A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes'. Together they form a unique fingerprint.

Cite this