TREE CODING WITH A FIDELITY CRITERION

被引:20
作者
DAVIS, CR
HELLMAN, ME
机构
[1] STANFORD UNIV, DEPT ELECT ENGN, STANFORD, CA 94305 USA
[2] MIT, CAMBRIDGE, MA USA
关键词
D O I
10.1109/TIT.1975.1055414
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:373 / 378
页数:6
相关论文
共 12 条
[1]   2-CYCLE ALGORITHM FOR SOURCE CODING WITH A FIDELITY CRITERION [J].
ANDERSON, JB ;
JELINEK, F .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (01) :77-92
[2]  
Athreya K, 1972, BRANCHING PROCESSES, DOI DOI 10.1007/978-3-642-65371-1
[3]  
Berger T., 2003, WILEY ENCY TELECOMMU
[4]   TREE ENCODING OF GAUSSIAN SOURCES [J].
DICK, RJ ;
BERGER, T ;
JELINEK, F .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (03) :332-336
[5]  
Feller W., 1968, INTRO PROBABILITY TH, V3rd
[6]   TREE ENCODING FOR SYMMETRIC SOURCES WITH A DISTORTION MEASURE [J].
GALLAGER, RG .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (01) :65-76
[7]  
Harris TE., 1963, THEORY BRANCHING PRO
[8]   COMPUTATION AND BOUNDING OF RATE-DISTORTION FUNCTIONS [J].
HASKELL, BG .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1969, 15 (05) :525-+
[9]   TREE ENCODING OF MEMORYLESS TIME-DISCRETE SOURCES WITH A FIDELITY CRITERION [J].
JELINEK, F .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1969, 15 (05) :584-+
[10]  
Parzen E., 1962, STOCHASTIC PROCESSES