BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES

被引：35

作者：

CAPOCELLI, RM

GIANCARLO, R

TANEJA, IJ

机构：

[1] COLUMBIA UNIV, DEPT COMP SCI, NEW YORK, NY 10027 USA

[2] UNIV FED SANTA CATARINA, DEPT COMP SCI, BR-88000 FLORIANOPOLIS, SC, BRAZIL

来源：

关键词：

D O I：

10.1109/TIT.1986.1057239

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：854 / 857

页数：4

共 7 条

[1]

BLUMER A, 1982, THESIS U ILLINOIS UR

[2] VARIATIONS ON A THEME BY HUFFMAN [J].

GALLAGER, RG .

[3] IMPROVED BOUND FOR WEIGHT-BALANCED TREE [J].

HORIBE, Y .

INFORMATION AND CONTROL, 1977, 34 (02) :148-151

[4] A METHOD FOR THE CONSTRUCTION OF MINIMUM-REDUNDANCY CODES [J].

HUFFMAN, DA .

PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1952, 40 (09) :1098-1101

[5] ON THE REDUNDANCY OF BINARY HUFFMAN CODES [J].

JOHNSEN, O .

[6]

REZA FM, 1951, INTRO INFORMATION TH

[7] A MATHEMATICAL THEORY OF COMMUNICATION [J].

SHANNON, CE .

BELL SYSTEM TECHNICAL JOURNAL, 1948, 27 (03) :379-423