Computer Science – Information Theory
Scientific paper
2011-02-10
Computer Science
Information Theory
6 pages, 2 figures
Scientific paper
This paper presents prefix codes which minimize various criteria constructed as a convex combination of maximum codeword length and average codeword length or maximum redundancy and average redundancy, including a convex combination of the average of an exponential function of the codeword length and the average redundancy. 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. The level of desirable merging has implication in applications where the maximum codeword length is bounded.
Charalambous Charalambos D.
Charalambous Themistoklis
Rezaei Farzad
No associations
LandOfFree
Lossless Coding with Generalised Criteria does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Lossless Coding with Generalised Criteria, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lossless Coding with Generalised Criteria will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-695076