BOUNDS FOR WEIGHT BALANCED TREES

被引:8
作者
RISSANEN, J [1 ]
机构
[1] IBM CORP, RES DIV LAB, SAN JOSE, CA 95114 USA
关键词
D O I
10.1147/rd.172.0101
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:101 / 105
页数:5
相关论文
共 10 条
[1]  
FANO RM, 1961, TRANSMISSION INFORMA
[2]   VARIABLE-LENGTH BINARY ENCODINGS [J].
GILBERT, EN ;
MOORE, EF .
BELL SYSTEM TECHNICAL JOURNAL, 1959, 38 (04) :933-967
[3]   OPTIMAL COMPUTER SEARCH TREES AND VARIABLE-LENGTH ALPHABETICAL CODES [J].
HU, TC ;
TUCKER, AC .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1971, 21 (04) :514-&
[4]  
Knuth D. E., 1971, Acta Informatica, V1, P14, DOI 10.1007/BF00264289
[5]  
Knuth Donald E, 1968, ART COMPUTER PROGRAM, V1
[6]  
NIEVERGELT J, 1971, P IFIP C, V71, P91
[7]  
NIEVERGELT J, 1972, 4 ANN S THEOR COMP S, P137
[8]  
NIEVERGELT J, 1970, UPPER BOUNDS TOTAL P
[9]   A MATHEMATICAL THEORY OF COMMUNICATION [J].
SHANNON, CE .
BELL SYSTEM TECHNICAL JOURNAL, 1948, 27 (03) :379-423
[10]   LINEAR SEARCH PROBLEM [J].
WONG, E .
SIAM REVIEW, 1964, 6 (02) :168-&