Asymptotic optimality of a universal variable-to-fixed length binary source coding algorithm

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

Summary form only given. The asymptotic performance of the modified Lawrence algorithm, a universal binary variable-to-fixed-length source coding algorithm has been investigated. For M (the segment set cardinality) large enough, it has been shown that the rate R(p) as a function of the source parameter p satisfies R(p) ≤ h(p)(1 + (log log M)/(2 log M)) for 0 < p < 1, where h(p) is the binary entropy function. It has also been proved that there exist no codes that have a better asymptotic performance, thereby establishing the asymptotic optimality of the modified Lawrence code. The asymptotic bounds show that universal variable-to-fixed-length codes can have a significantly lower redundancy than universal fixed-to-variable-length codes with the same number of code words.

Original languageEnglish
Title of host publication1990 IEEE International Symposium on Information Theory (ISIT 1990)
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Number of pages1
Publication statusPublished - 1 Dec 1990
Event1990 IEEE International Symposium on Information Theory (ISIT 1990) - San Diego, United States
Duration: 14 Jan 199019 Jan 1990

Conference

Conference1990 IEEE International Symposium on Information Theory (ISIT 1990)
Abbreviated titleISIT 1990
CountryUnited States
CitySan Diego
Period14/01/9019/01/90

Fingerprint Dive into the research topics of 'Asymptotic optimality of a universal variable-to-fixed length binary source coding algorithm'. Together they form a unique fingerprint.

Cite this