INTERVAL AND RECENCY RANK SOURCE-CODING - 2 ONLINE ADAPTIVE VARIABLE-LENGTH SCHEMES

被引:61
作者
ELIAS, P [1 ]
机构
[1] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139
关键词
D O I
10.1109/TIT.1987.1057251
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:3 / 10
页数:8
相关论文
共 25 条
[1]  
Bentley J. L., 1976, Information Processing Letters, V5, P82, DOI 10.1016/0020-0190(76)90071-5
[2]  
BENTLEY JL, 1984, 22ND P ALL C COMM CO, P233
[3]   A SOURCE MATCHING APPROACH TO FINDING MINIMAX CODES [J].
DAVISSON, LD ;
LEONGARCIA, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (02) :166-174
[4]  
ELIAS P, 1975, IEEE T INFORM THEORY, V21, P194, DOI 10.1109/TIT.1975.1055349
[5]   MINIMUM TIMES AND MEMORIES NEEDED TO COMPUTE VALUES OF A FUNCTION [J].
ELIAS, P .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (02) :196-212
[6]   MINIMAX OPTIMAL UNIVERSAL CODEWORD SETS [J].
ELIAS, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (04) :491-502
[7]   ECONOMICAL ENCODING OF COMMAS BETWEEN STRINGS [J].
EVEN, S ;
RODEH, M .
COMMUNICATIONS OF THE ACM, 1978, 21 (04) :315-317
[8]  
Faller N., 1973, 7 AS C CIRC SYST COM, P593
[9]   VARIATIONS ON A THEME BY HUFFMAN [J].
GALLAGER, RG .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (06) :668-674
[10]   DYNAMIC HUFFMAN CODING [J].
KNUTH, DE .
JOURNAL OF ALGORITHMS, 1985, 6 (02) :163-180