Optimal merging algorithms for lossless codes with generalized criteria

Themistoklis Charalambous, Charalambos D. Charalambous, Farzad Rezaei

Tutkimustuotos: LehtiartikkeliArticleScientificvertaisarvioitu

Abstrakti

This paper presents lossless prefix codes optimized with respect to a payoff criterion consisting of a convex combination of maximum codeword length and average codeword length. The optimal codeword lengths obtained are based on a new coding algorithm, which transforms the initial source probability vector into a new probability vector according to a merging rule. The coding algorithm is equivalent to a partition of the source alphabet into disjoint sets on which a new transformed probability vector is defined as a function of the initial source probability vector and scalar parameter. The payoff criterion considered encompasses a tradeoff between maximum and average codeword length; it is related to a payoff criterion consisting of a convex combination of average codeword length and average of an exponential function of the codeword length, and to an average codeword length payoff criterion subject to a limited length constraint. A special case of the first related payoff is connected to coding problems involving source probability uncertainty and codeword overflow probability, whereas the second related payoff compliments limited length Huffman coding algorithms.

AlkuperäiskieliEnglanti
Artikkeli6851189
Sivut5486-5499
Sivumäärä14
JulkaisuIEEE Transactions on Information Theory
Vuosikerta60
Numero9
DOI - pysyväislinkit
TilaJulkaistu - 2014
OKM-julkaisutyyppiA1 Julkaistu artikkeli, soviteltu

Sormenjälki Sukella tutkimusaiheisiin 'Optimal merging algorithms for lossless codes with generalized criteria'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

  • Siteeraa tätä