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

Authors:
Mordecai J. Golin;HyeonSuk Na
Affiliations:
-;-
Venue:
DCC '01 Proceedings of the Data Compression Conference
Year:
2001

Citing 5
Cited 2

Optimum lopsided binary trees

Journal of the ACM (JACM)
Introduction to algorithms

Introduction to algorithms
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters

Journal of the ACM (JACM)
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

Online prefix-free encoding algorithm

SPPRA'06 Proceedings of the 24th IASTED international conference on Signal processing, pattern recognition, and applications
The structure of optimal prefix-free codes in restricted languages: the uniform probability case

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 L. We examine how, given certain types of L, the structure of the minimum-cost code changes as n; the number of codewords, grows.