Fountain capacity

被引：19

作者：

Shamai, Shlomo ^{[1
]}

Telatar, I. Emre

Verdu, Sergio

机构：

[1] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Technion, Haifa, Israel

[2] Ecole Polytech Fed Lausanne, Sch Comp & Commun Sci I &C, Informat Theory Lab LTHI, CH-1015 Lausanne, Switzerland

[3] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2007年 / 53卷 / 11期

基金：

美国国家科学基金会;

关键词：

arbitrarily varying channels; channel capacity; content distribution; erasure channels; fountain codes;

D O I：

10.1109/TIT.2007.907495

中图分类号：

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

学科分类号：

0812 ;

摘要：

Fountain codes are currently employed for reliable and efficient transmission of information via erasure channels with unknown erasure rates. This correspondence introduces the notion of fountain capacity for arbitrary channels. In contrast to the conventional definition of rate, in the fountain setup the definition of rate penalizes the reception of symbols by the receiver rather than their transmission. Fountain capacity measures the maximum rate compatible with reliable reception regardless of the erasure pattern. We show that fountain capacity and Shannon capacity are equal for stationary memoryless; channels. In contrast, Shannon capacity may exceed fountain capacity if the channel has memory or is not stationary.

引用

页码：4372 / 4376

页数：5

共 20 条

[1]

CAIRE G, 2004, P 2004 IEEE WORKSH I

[2] GAUSSIAN FEEDBACK CAPACITY [J].

COVER, TM ;

POMBRA, S .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (01) :37-43

[3] Comments on broadcast channels [J].

Cover, TM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2524-2530

[4]

Csiszar I., 1981, INFORM THEORY CODING

[5]

Doob JL., 1953, Stochastic Process

[6]

EREZ U, 2006, P INF THEOR APPL WOR

[7] Raptor codes on binary memoryless symmetric channels [J].

Etesami, O ;

Shokrollahi, A .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) :2033-2051

[8] Source broadcasting with unknown amount of receiver side information [J].

Feder, M ;

Shulman, N .

PROCEEDINGS OF 2002 IEEE INFORMATION THEORY WORKSHOP, 2002, :127-130

[9]

Gallager R. G., 1968, INFORM THEORY RELIAB

[10] Reliable communication under channel uncertainty [J].

Lapidoth, A ;

Narayan, P .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2148-2177

← 1 2 →