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 条

[1] GOOD CODES CAN BE PRODUCED BY A FEW PERMUTATIONS [J].

AHLSWEDE, R ;

DUECK, G .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (03) :430-443

[2] THE RATE-DISTORTION REGION FOR MULTIPLE DESCRIPTIONS WITHOUT EXCESS RATE [J].

AHLSWEDE, R .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (06) :721-726

[3]

Ahlswede R., 1979, J COMBINATORICS INF, V4, P76

[4]

AHLSWEDE R, DISTORTION REGION BI

[5]

Ahlswede R., 1980, J COMBIN INFORM SYST, V5, P220

[6]

Ahlswede R., 1973, 6TH T PRAG C INF THE, P23

[7]

Ahlswede R., 1982, J COMBINAT INF SYST, V7, P216

[8]

BERGER T, UNPUB THEOREM DIVERS

[9]

BERGER T, MINIMUM BREAKDOWN DE

[10]

Dueck G., 1981, J COMBINAT INF SYST, V6, P187

← 1 2 →