Lossless coding with generalized criteria

Themistoklis Charalambous*, Charalambos D. Charalambous, Farzad Rezaei

*Corresponding author for this work

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

1 Citation (Scopus)

Abstract

This paper presents prefix codes which minimize various criteria constructed as a convex combination of maximum codeword length and average codeword length, or, a convex combination of the average of an exponential function of the codeword length and the average codeword length. This framework encompasses as a special case several criteria previously investigated in the literature, while relations to universal coding is discussed. The coding algorithm derived is parametric resulting in re-adjusting the initial source probabilities via a weighted probability vector according to a merging rule. An algorithm is presented to compute the weighting vector.

Original languageEnglish
Title of host publication2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages1131-1135
Number of pages5
DOIs
Publication statusPublished - 2011
MoE publication typeA4 Article in a conference publication
EventIEEE International Symposium on Information Theory - St. Petersburg, Russian Federation
Duration: 31 Jul 20115 Aug 2011

Conference

ConferenceIEEE International Symposium on Information Theory
Abbreviated titleISIT
Country/TerritoryRussian Federation
CitySt. Petersburg
Period31/07/201105/08/2011

Fingerprint

Dive into the research topics of 'Lossless coding with generalized criteria'. Together they form a unique fingerprint.

Cite this