TREE CODING OF DISCRETE-TIME ABSTRACT ALPHABET STATIONARY BLOCK-ERGODIC SOURCES WITH A FIDELITY CRITERION

被引：6

作者：

TAN, HH ^{[1
]}

机构：

[1] PRINCETON UNIV, DEPT ELECT ENGN, PRINCETON, NJ 08540 USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1976年 / 22卷 / 06期

关键词：

D O I：

10.1109/TIT.1976.1055641

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：671 / 681

页数：11

共 15 条

[1] TREE ENCODING OF STATIONARY ERGODIC SOURCES WITH A FIDELITY-CRITERION
HASHIMOTO, T
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (05) : 650 - 656
[2] TIME-INVARIANT TRELLIS ENCODING OF ERGODIC DISCRETE-TIME SOURCES WITH A FIDELITY CRITERION
GRAY, RM
IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (01) : 71 - 83
[3] NOTE ON ABSTRACT-ALPHABET BLOCK SOURCE CODING WITH A FIDELITY CRITERION THEOREM
DUNHAM, JG
IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (06) : 760 - 760
[4] ABSTRACT ALPHABET SLIDING-BLOCK ENTROPY COMPRESSION CODING WITH A FIDELITY-CRITERION
DUNHAM, JG
ANNALS OF PROBABILITY, 1980, 8 (06): : 1085 - 1092
[5] TRELLIS ENCODING OF MEMORYLESS DISCRETE-TIME SOURCES WITH A FIDELITY CRITERION
VITERBI, AJ
OMURA, JK
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (03) : 325 - 332
[6] On a Universal Antidictionary Coding for Stationary Ergodic Sources with Finite Alphabet
Ota, Takahiro
Morita, Hiroyoshi
2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA), 2014, : 294 - 298
[7] TREE ENCODING OF MEMORYLESS TIME-DISCRETE SOURCES WITH A FIDELITY CRITERION
JELINEK, F
IEEE TRANSACTIONS ON INFORMATION THEORY, 1969, 15 (05) : 584 - +
[8] TREE ENCODING OF MEMORYLESS TIME-DISCRETE SOURCES WITH A FIDELITY CRITERION
JELINEK, F
IEEE TRANSACTIONS ON INFORMATION THEORY, 1970, 16 (01) : 119 - +
[9] BLOCK CODING FOR STATIONARY GAUSSIAN SOURCES WITH MEMORY UNDER A SQUARE-ERROR FIDELITY CRITERION
TAN, HH
INFORMATION AND CONTROL, 1975, 29 (01): : 11 - 28
[10] Error exponent of coding for stationary memoryless sources with a fidelity criterion
Ihara, S
Kubo, M
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (05) : 1339 - 1345

← 1 2 →