Network Coding for Line Networks with Broadcast Channels

被引：0

作者：

Kramer, Gerhard ^{[1
]}

Yazdi, Seyed Mohammadsadegh Tabatabaei ^{[2
]}

机构：

[1] Tech Univ Munich, Inst Commun Engn, D-80333 Munich, Germany

[2] Corp R&D, Qualcomm, San Diego, CA 92121 USA

来源：

ENTROPY | 2012年 / 14卷 / 10期

关键词：

broadcast channels; capacity; network coding; relay channels; CAPACITY;

D O I：

10.3390/e14101813

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

An achievable rate region for line networks with edge and node capacity constraints and broadcast channels (BCs) is derived. The region is shown to be the capacity region if the BCs are orthogonal, deterministic, physically degraded, or packet erasure with one-bit feedback. If the BCs are physically degraded with additive Gaussian noise then independent Gaussian inputs achieve capacity.

引用

页码：1813 / 1828

页数：16

共 20 条

[1] Wireless Network Information Flow: A Deterministic Approach
Avestimehr, A. Salman
Diggavi, Suhas N.
Tse, David N. C.
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (04) : 1872 - 1905
[2] BAKSHI M, 2007, P IEEE INT S INF THE
[3] Cover T.M., 2006, ELEMENTS INFORM THEO, V2nd ed
[4] BROADCAST CHANNELS
COVER, TM
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1972, 18 (01) : 2 - +
[5] A PROOF OF MARTON CODING THEOREM FOR THE DISCRETE MEMORYLESS BROADCAST CHANNEL
ELGAMAL, A
VANDERMEULEN, EC
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (01) : 120 - 122
[6] ELGAMAL A, 1978, IEEE T INFORM THEORY, V24, P379, DOI 10.1109/TIT.1978.1055885
[7] Georgiadis L., 2009, P WORKSH NETW COD TH
[8] Two-way radio networks with a star topology
Knopp, Raymond
[J]. 2006 INTERNATIONAL ZURICH SEMINAR ON COMMUNICATIONS: ACCESS - TRANSMISSION - NETWORKING, PROCEEDINGS, 2006, : 154 - 157
[9] Capacity results for the discrete memoryless network
Kramer, G
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (01) : 4 - 21
[10] Kramer G., 2006, WORKSH INF THEOR APP

← 1 2 →