The structure of optimal prefix-free codes in restricted languages: The uniform probability case
Golin, Mordecai J.
|Source||Lecture Notes in Computer Science , v. 3608, 2005, p. 372-384|
|Summary||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 L and extend the classes of languages to which C can belong.|
View full-text via Web of Science
View full-text via Scopus