Preprint on CoRR archive: arXiv cs/0702059; last updated 7 Oct 2010.
ISSN/ISBN: Not available at this time. DOI: Not available at this time.
Abstract: This paper presents new lower and upper bounds for the compression rate of optimal binary prefix codes on memoryless sources according to various nonlinear codeword length objectives. Like the most well-known redundancy bounds for minimum (arithmetic) average redundancy coding -- Huffman coding -- these are in terms of a form of entropy and/or the probability of the most probable input symbol. The bounds here improve on known bounds of the form L ∈ [H,H+1), where H is some form of entropy in bits (or, in the case of redundancy measurements, 0) and L is the length objective, also in bits. The objectives explored here include exponential-average length, maximum pointwise redundancy, and exponential-average pointwise redundancy (also called d-th exponential redundancy). These relate to queueing and single-shot communications, Shannon coding and universal modeling (worst-case minimax redundancy), and bridging the maximum pointwise redundancy problem with Huffman coding, respectively. A generalized form of Huffman coding known to find optimal codes for these objectives helps yield these bounds, some of which are tight. Related properties to such bounds, also explored here, are the necessary and sufficient conditions for the shortest codeword being a specific length.
Bibtex:
@article{,
author = {Michael B. Baer},
title = {Bounds on Generalized Huffman Codes},
journal = {CoRR},
volume = {abs/cs/0702059},
year = {2007},
url = {http://arxiv.org/abs/cs/0702059},
archivePrefix = {arXiv},
eprint = {cs/0702059},
note = {last updated October 7, 2010},
}
Reference Type: Preprint
Subject Area(s): Computer Science