The structure of optimal prefix-free codes in restricted languages: the uniform probability case

Authors:
Mordecai J. Golin;Zhenming Liu
Affiliations:
Department of Computer Science, HKUST, Clear Water Bay, Kowloon, Hong Kong;Department of Computer Science, HKUST, Clear Water Bay, Kowloon, Hong Kong
Venue:
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Year:
2005

Citing 11
Cited 0

Optimum lopsided binary trees

Journal of the ACM (JACM)
Prefix Codes: Equiprobable Words, Unequal Letter Costs

SIAM Journal on Computing
Tree Structures for Optimal Searching

Journal of the ACM (JACM)
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters

Journal of the ACM (JACM)
Codes: Unequal Probabilities, Unequal Letter Cost

Journal of the ACM (JACM)
Optimal point-to-point broadcast algorithms via lopsided trees

Discrete Applied Mathematics
Elements of the Theory of Computation

Elements of the Theory of Computation
Optimal Prefix-Free Codes that end in a Specified Pattern and Similar Problems: The Uniform Probability Case (Extended Abstract)

DCC '01 Proceedings of the Data Compression Conference
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs

IEEE Transactions on Information Theory
A probabilistic approach to some asymptotics in noiseless communication

IEEE Transactions on Information Theory
A dynamic programming algorithm for constructing optimal “1”-ended binary prefix-free codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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 $\mathcal{L}$ and extend the classes of languages to which $\mathcal{L}$ can belong.