A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes

被引：0

作者：

Chan, SL ^{[1
]}

Golin, M ^{[1
]}

机构：

[1] Hong Kong Univ Sci & Technol, Dept Comp Sci, Hong Kong, Hong Kong

来源：

1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS | 1998年

关键词：

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

We discuss the problem of efficiently constructing minimum-cost binary prefix-free codes having the property that each codeword ends with a "1".

引用

页码：45 / 45

页数：1

共 50 条

[1] A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes
Chan, SL
Golin, MJ
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) : 1637 - 1644
[2] A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
Golin, MJ
Rote, G
[J]. AUTOMATA, LANGUAGES AND PROGRAMMING, 1995, 944 : 256 - 267
[3] A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
Golin, MJ
Rote, G
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (05) : 1770 - 1781
[4] Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
Bradford, P
Golin, MJ
Larmore, LL
Rytter, W
[J]. JOURNAL OF ALGORITHMS, 2002, 42 (02) : 277 - 303
[5] Properties of Optimal Prefix-Free Machines as Instantaneous Codes
Tadaki, Kohtaro
[J]. 2010 IEEE INFORMATION THEORY WORKSHOP (ITW), 2010,
[6] Faster algorithm for designing optimal prefix-free codes with unequal letter costs
Dumitrescu, Sorina
[J]. DCC 2006: Data Compression Conference, Proceedings, 2006, : 444 - 444
[7] Faster algorithm for designing optimal prefix-free codes with unequal letter costs
Dumitrescu, Sorina
[J]. FUNDAMENTA INFORMATICAE, 2006, 73 (1-2) : 107 - 117
[8] Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes
Javad-Kalbasi, Mohammad
Khosravifard, Mohammadali
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (07) : 4419 - 4430
[9] OPTIMUM 1-ENDED BINARY PREFIX CODES
BERGER, T
YEUNG, R
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 311 : 68 - 75
[10] A fast algorithm for constructing nearly optimal prefix codes
Osorio, Roberto R.
Gonzalez, Patricia
[J]. SOFTWARE-PRACTICE & EXPERIENCE, 2016, 46 (10): : 1299 - 1316

← 1 2 3 4 5 →