OPTIMUM 1-ENDED BINARY PREFIX CODES

被引：0

|

作者：

BERGER, T

YEUNG, R

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1988年 / 311卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：68 / 75

页数：8

相关论文

共 50 条

[1] OPTIMUM 1-ENDED BINARY PREFIX CODES
BERGER, T
YEUNG, RW
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (06) : 1435 - 1441
[2] BINARY PREFIX CODES ENDING IN A 1
CAPOCELLI, RM
DESANTIS, A
PERSIANO, G
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (04) : 1296 - 1302
[3] A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes
Chan, SL
Golin, M
[J]. 1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 45 - 45
[4] 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
[5] Optimum extensions of prefix codes
Mandoiu, II
[J]. INFORMATION PROCESSING LETTERS, 1998, 66 (01) : 35 - 40
[6] Imprimitivity of locally finite, 1-ended, planar graphs
Siran, Jozef
Watkins, Mark E.
[J]. ARS MATHEMATICA CONTEMPORANEA, 2012, 5 (02) : 217 - 221
[7] Extended synchronizing codewords for binary prefix codes
Lam, WM
Kulkarni, SR
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (03) : 984 - 987
[8] Optimal binary one-ended codes
Kukorelly, Z
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (07) : 2125 - 2132
[9] OPTIMAL BINARY PREFIX-CONDITION CODES WITH ORDINAL PROBABILITIES
GREENBERG, I
[J]. JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE, 1990, 41 (05): : 330 - 333
[10] The number of optimal binary one-ended codes
Kukorelly, Z
[J]. 2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 14 - 14

← 1 2 3 4 5 →