Title :
Bounds on the moments of codeword lengths using Arikan´s inequality
Author_Institution :
DIMACS Center, Rutgers Univ., Piscataway, NJ, USA
Abstract :
Arikan´s (see IEEE Trans. Inform. Theory, vol.42, p.99-105, 1996) guessing inequality is seen to be of broader applicability and can be used to lower bound the moments of sequences other than the guessing sequence, for example the sequence of Huffman codeword lengths, the guessing sequence for variable costs, and the sequence of Varn (1971) codeword lengths
Keywords :
Huffman codes; binary codes; binary sequences; combinatorial mathematics; Arikan´s guessing inequality; Huffman codeword lengths; Varn codeword lengths; binary Huffman codeword; combinatorial probability problems; combinatorial search; guessing sequence; lower bound; moments; sequences; source coding; variable costs; Cost function; Entropy; Random variables; Source coding;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.709036
