Lossless coding with generalized criteria

Themistoklis Charalambous; Charalambos D. Charalambous; Farzad Rezaei

doi:10.1109/ISIT.2011.6033708

Lossless coding with generalized criteria

Themistoklis Charalambous^*, Charalambos D. Charalambous, Farzad Rezaei

^*Corresponding author for this work

University of Cyprus

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-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 language	English
Title of host publication	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages	1131-1135
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2011.6033708
Publication status	Published - 2011
MoE publication type	A4 Conference publication
Event	IEEE International Symposium on Information Theory - St. Petersburg, Russian Federation Duration: 31 Jul 2011 → 5 Aug 2011

Conference

Conference	IEEE International Symposium on Information Theory
Abbreviated title	ISIT
Country/Territory	Russian Federation
City	St. Petersburg
Period	31/07/2011 → 05/08/2011

Access to Document

10.1109/ISIT.2011.6033708

Cite this

@inproceedings{d2c6280ae4ab4d6e9e244b4f75a0b84f,

title = "Lossless coding with generalized criteria",

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

author = "Themistoklis Charalambous and Charalambous, {Charalambos D.} and Farzad Rezaei",

year = "2011",

doi = "10.1109/ISIT.2011.6033708",

language = "English",

isbn = "9781457705953",

pages = "1131--1135",

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

note = "IEEE International Symposium on Information Theory, ISIT ; Conference date: 31-07-2011 Through 05-08-2011",

}

TY - GEN

T1 - Lossless coding with generalized criteria

AU - Charalambous, Themistoklis

AU - Charalambous, Charalambos D.

AU - Rezaei, Farzad

PY - 2011

Y1 - 2011

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

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

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

U2 - 10.1109/ISIT.2011.6033708

DO - 10.1109/ISIT.2011.6033708

M3 - Conference article in proceedings

AN - SCOPUS:80054812368

SN - 9781457705953

SP - 1131

EP - 1135

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

T2 - IEEE International Symposium on Information Theory

Y2 - 31 July 2011 through 5 August 2011

ER -

Lossless coding with generalized criteria

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this