On capacity regions of non-multicast networks

被引：20

作者：

Chan, Terence ^{[1
]}

Grant, Alex ^{[1
]}

机构：

[1] Univ S Australia, Inst Telecommun Res, Adelaide, SA 5001, Australia

来源：

2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY | 2010年

关键词：

INFORMATION INEQUALITIES;

D O I：

10.1109/ISIT.2010.5513732

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study the network coding capacity of multisource, multi-sink networks with colocated sources, but where each sink may demand a different subset of the sources. We show that in this scenario, the set of admissible (zero probability of decoding errors) and achievable (vanishing probability of decoding errors) rate capacity tuples are the same. We also simplify the capacity region by showing that the outer bound obtained in "A First Course in Information Theory" (Yeung, 2002) is in fact tight. We conjecture that this bound remains tight, even when the sources are not colocated.

引用

页码：2378 / 2382

页数：5

共 8 条

[1]

[Anonymous], 2002, A first course in information theory

[2] Dualities between entropy functions and network codes [J].

Chan, Terence ;

Grant, Alex .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (10) :4470-4487

[3] On a relation between information inequalities and group theory [J].

Chan, TH ;

Yeung, RW .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (07) :1992-1995

[4]

CHAN TH, 2001, COMMUN INF SYST, V1, P1

[5] Insufficiency of linear coding in network information flow [J].

Dougherty, R ;

Freiling, C ;

Zeger, K .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (08) :2745-2759

[6] Zero-effor network coding for acyclic networks [J].

Song, LH ;

Yeung, RW .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (12) :3129-3139

[7]

YAN X, 2007, IEEE INT S INFORM TH

[8] A framework for linear information inequalities [J].

Yeung, RW .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (06) :1924-1934

← 1 →