Title :
Huffman-type codes for infinite source distributions
Author_Institution :
Math. Sci. Div., Naval Res. Office, Arlington, VA, USA
Abstract :
A new sufficient condition is given for an infinite source distribution to share a minimum average codeword length code with a geometric distribution. Thus some new examples of parametric families of infinite source distributions can be optimally encoded by Huffman-type codes
Keywords :
Huffman codes; encoding; Huffman-type codes; geometric distribution; infinite source distributions; minimum average codeword length code; optimal encoding; parametric families; sufficient condition; Argon; Government; Operations research; Probability; Protection; Search problems; Statistical analysis; Statistical distributions; Sufficient conditions; Testing;
Conference_Titel :
Data Compression Conference, 1994. DCC '94. Proceedings
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-5637-9
DOI :
10.1109/DCC.1994.305915
