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

We discuss the problem of efficiently constructing minimum-cost binary prefix-free codes having the property that each codeword ends with a "1".

[1]  Alfredo De Santis,et al.  On the construction of statistically synchronizable codes , 1992, IEEE Trans. Inf. Theory.

[2]  Toby Berger,et al.  Optimum '1' ended binary prefix codes , 1990, IEEE Trans. Inf. Theory.

[3]  Sze-Lok Chan.  Variants of prefix-free codes , 1997 .