UNIVERSAL ALMOST SURE DATA-COMPRESSION

被引：44

作者：

ORNSTEIN, DS ^{[1
]}

SHIELDS, PC ^{[1
]}

机构：

[1] UNIV TOLEDO,DEPT MATH,TOLEDO,OH 43606

来源：

ANNALS OF PROBABILITY | 1990年 / 18卷 / 02期

关键词：

D O I：

10.1214/aop/1176990840

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

引用

页码：441 / 452

页数：12

共 12 条

[1] UNIVERSAL NOISELESS CODING [J].

DAVISSON, LD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (06) :783-795

[2]

ELIAS P, 1975, IEEE T INFORM THEORY, V21, P194, DOI 10.1109/TIT.1975.1055349

[3] R-ENTROPY, EQUIPARTITION, AND ORNSTEIN ISOMORPHISM THEOREM IN RN [J].

FELDMAN, J .

ISRAEL JOURNAL OF MATHEMATICS, 1980, 36 (3-4) :321-345

[4]

FITTINGHOF BM, 1966, PROBLEMS INFORM TRAN, V2, P3

[5] UNIFIED APPROACH TO WEAK UNIVERSAL SOURCE CODING [J].

KIEFFER, JC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (06) :674-682

[6] SEQUENCE TIME CODING FOR DATA COMPRESSION [J].

LYNCH, TJ .

PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1966, 54 (10) :1490-&

[7] THE SHANNON-MCMILLAN-BREIMAN THEOREM FOR A CLASS OF AMENABLE-GROUPS [J].

ORNSTEIN, D ;

WEISS, B .

ISRAEL JOURNAL OF MATHEMATICS, 1983, 44 (01) :53-60

[8]

ORNSTEIN D, 1990, IN PRESS ANN PROBAB, V18

[9] THE ERGODIC AND ENTROPY THEOREMS REVISITED [J].

SHIELDS, PC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (02) :263-266

[10] UNIVERSAL ALGORITHM FOR SEQUENTIAL DATA COMPRESSION [J].

ZIV, J ;

LEMPEL, A .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (03) :337-343

← 1 2 →