Abstract
In this paper we discuss the problem of constructing minimum-cost, prefix-free codes for equiprobable words under the assumption that all codewords are restricted to belonging to an arbitrary language ℒ and extend the classes of languages to which ℒ can belong. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
APA
Golin, M. J., & Liu, Z. (2005). The structure of optimal prefix-free codes in restricted languages: The uniform probability case. In Lecture Notes in Computer Science (Vol. 3608, pp. 372–384). Springer Verlag. https://doi.org/10.1007/11534273_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free