ON MULTIPLE DESCRIPTIONS AND TEAM GUESSING

被引：16

作者：

AHLSWEDE, R

机构：

[1] Univ of Bielefeld, West Ger, Univ of Bielefeld, West Ger

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1986年 / 32卷 / 04期

关键词：

PROBABILITY;

D O I：

10.1109/TIT.1986.1057195

中图分类号：

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

学科分类号：

0812 ;

摘要：

The author reviews H. S. Witsenhausen's (1980) hyperbola bound for the multiple description problem without excess rate in cases of a binary source which is not tight for exact joint reproductions. but is tight for almost-exact joint reproductions. This result is proved using an approximate form of the team guessing lemma for sequences of random variables. The hyperbola bound is also proved tight for exact joint reproductions and arbitrarily small, but positive, excess rate. The proof of this result uses a covering lemma derived by the author.

引用

页码：543 / 549

页数：7

共 19 条

[11]

ELGAMAL AA, 1982, IEEE T INFORM THEORY, V28, P851, DOI 10.1109/TIT.1982.1056588

[12] ON A SOURCE-CODING PROBLEM WITH 2 CHANNELS AND 3 RECEIVERS [J].

OZAROW, L .

BELL SYSTEM TECHNICAL JOURNAL, 1980, 59 (10) :1909-1921

[13]

PINSKER MS, 1960, PROBLEMY PEREDACI IN, V7

[14] ON TEAM GUESSING WITH INDEPENDENT INFORMATION [J].

WITSENHAUSEN, HS .

MATHEMATICS OF OPERATIONS RESEARCH, 1981, 6 (02) :293-304

[15] ON SOURCE NETWORKS WITH MINIMAL BREAKDOWN DEGRADATION [J].

WITSENHAUSEN, HS .

BELL SYSTEM TECHNICAL JOURNAL, 1980, 59 (06) :1083-1087

[16] TEAM GUESSING WITH LACUNARY INFORMATION [J].

WITSENHAUSEN, HS .

MATHEMATICS OF OPERATIONS RESEARCH, 1983, 8 (01) :110-121

[17] SOURCE-CODING FOR MULTIPLE DESCRIPTIONS .2. A BINARY SOURCE [J].

WITSENHAUSEN, HS ;

WYNER, AD .

BELL SYSTEM TECHNICAL JOURNAL, 1981, 60 (10) :2281-2292

[18] SOURCE-CODING FOR MULTIPLE DESCRIPTIONS [J].

WOLF, JK ;

WYNER, AD ;

ZIV, J .

BELL SYSTEM TECHNICAL JOURNAL, 1980, 59 (08) :1417-1426

[19]

[No title captured]

← 1 2 →