Graph explorer

Noisy Network Coding

A noisy network coding scheme for sending multiple sources over a general noisy network is presented. For multi-source multicast networks, the scheme naturally extends both network coding over noiseless networks by Ahlswede, Cai, Li, and Yeung, and compress-forward coding for the relay channel by Cover and El Gamal to general discrete memoryless and Gaussian networks. The scheme also recovers as special cases the results on coding for wireless relay networks and deterministic networks by Avestimehr, Diggavi, and Tse, and coding for wireless erasure networks by Dana, Gowaikar, Palanki, Hassibi, and Effros. The scheme involves message repetition coding, relay signal compression, and simultaneous decoding. Unlike previous compress--forward schemes, where independent messages are sent over multiple blocks, the same message is sent multiple times using independent codebooks as in the network coding scheme for cyclic networks. Furthermore, the relays do not use Wyner--Ziv binning as in previous compress-forward schemes, and each decoder performs simultaneous joint typicality decoding on the received signals from all the blocks without explicitly decoding the compression indices. A conseq

7 nodes7 linksoverview mapNoisy Network Coding
7 nodes7 links
Noisy Network Coding7 visible / 7 total nodes / 13 links
Works onCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipAuthorshipTopic signalTopic signalWNoisy Network Codingpreprint / 2010ASung Hoon LimResearcherAYoung-Han KimResearcherAAbbas El GamalResearcherASae-Young ChungResearcherTInformation Theory6710 worksTmath.IT6610 works
PaperSignal 106 links

Noisy Network Coding

preprint / 2010

Open