An efficient algorithm for constructing nearly optimal prefix codes
نویسندگان
چکیده
منابع مشابه
An Approximation Algorithm for Constructing Error Detecting Prefix Codes
A k-bit Hamming prefix code is a binary code with the following property: for any codeword x and any prefix y of another codeword, both x and y having the same length, the Hamming distance between x and y is at least k. Given an alphabet A = [a1, . . . , an] with corresponding probabilities [p1, . . . , pn], the k-bit Hamming prefix code problem is to find a k-bit Hamming prefix code for A with...
متن کاملA Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs
We consider the problem of constructing prefix-free codes of minimum cost when the encoding alphabet contains letters of unequal length. The complexity of this problem has been unclear for thirty years with the only algorithm known for its solution involving a transformation to integer linear programming. In this paper we introduce a new dynamic programming solution to the problem. It optimally...
متن کاملA dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes
The generic Huffman-Encoding Problem of finding a minimum cost prefix-free code is almost completely understood. There still exist many variants of this problem which are not as well understood, though. One such variant, requiring that each of the codewords ends with a “1,” has recently been introduced in the literature with the best algorithms known for finding such codes running in exponentia...
متن کاملAn Efficient Algorithm for Constructing Optimal Design of Computer Experiments
Metamodeling approach has been widely used due to the high computational cost of using high-fidelity simulations in engineering design. The accuracy of metamodels is directly related to the experimental designs used. Optimal experimental designs have been shown to have good “space filling” and projective properties. However, the high cost in constructing them limits their use. In this paper, a ...
متن کاملOptimal Prefix Codes and Huffman Codes
DONGYANG LONG*, WEIJIA JIAc,y and MING LId,z Department of Computer Science, Zhongshan University, Guangzhou 510275, Guangdong, P.R.C.; The State Key Laboratory of Information Security, Chinese Academy of Sciences, Beijing 100039, P.R.C.; Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong, P.R.C.; School of Computing, National University of Sing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1980
ISSN: 0018-9448
DOI: 10.1109/tit.1980.1056250