Title :
A dynamic programming algorithm for constructing optimal “1”-ended binary prefix-free codes
Author :
Chan, Sze-Lok ; Golin, Mordecai
Author_Institution :
Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., Clear Water Bay, Hong Kong
Abstract :
We discuss the problem of efficiently constructing minimum-cost binary prefix-free codes having the property that each codeword ends with a “1”
Keywords :
binary codes; dynamic programming; 1-ended binary prefix-free codes; codeword; dynamic programming algorithm; minimum-cost binary prefix-free codes; Binary codes; Code standards; Computer science; Costs; Dynamic programming; Encoding; Entropy; Heuristic algorithms; Probability distribution; Water;
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.708625
