On message lengths for noisy network coding

Quantize-map-forward (QMF) and noisy network coding (NNC) differ primarily from compress-forward relaying in that relays do not hash their quantization bits. Two further differences are that source nodes use “long”-message repetitive encoding and destination nodes use simultaneous joint decoding. Recent work has shown that classic “short”-message encoding combined with backward decoding achieves the same rates as QMF and NNC. A simplified proof of this result is given.

[1]  Sae-Young Chung,et al.  Noisy network coding , 2010 .

[2]  Xiugang Wu,et al.  On the Optimal Compressions in the Compress-and-Forward Relay Schemes , 2010, IEEE Transactions on Information Theory.

[3]  Abbas El Gamal,et al.  Bounds on capacity and minimum energy-per-bit for AWGN relay channels , 2006, IEEE Transactions on Information Theory.

[4]  Xiugang Wu,et al.  On the optimality of successive decoding in compress-and-forward relay schemes , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[5]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[6]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[7]  Suhas N. Diggavi,et al.  Wireless Network Information Flow: A Deterministic Approach , 2009, IEEE Transactions on Information Theory.

[8]  Gerhard Kramer,et al.  Short-message quantize-forward network coding , 2011, 2011 8th International Workshop on Multi-Carrier Systems & Solutions.