A dynamic programming algorithm for constructing optimal 1 -ended binary prefix-free codes

Sze-Lok Chan, Mordecai J. Golin. A dynamic programming algorithm for constructing optimal 1 -ended binary prefix-free codes. IEEE Transactions on Information Theory, 46(4):1637-1644, 2000.

Authors

Sze-Lok Chan

This author has not been identified. Look up 'Sze-Lok Chan' in Google

Mordecai J. Golin

This author has not been identified. Look up 'Mordecai J. Golin' in Google