TY - GEN
T1 - On message lengths for noisy network coding
AU - Kramer, Gerhard
AU - Hou, Jie
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/83655191120
U2 - 10.1109/ITW.2011.6089495
DO - 10.1109/ITW.2011.6089495
M3 - Conference contribution
AN - SCOPUS:83655191120
SN - 9781457704376
T3 - 2011 IEEE Information Theory Workshop, ITW 2011
SP - 430
EP - 431
BT - 2011 IEEE Information Theory Workshop, ITW 2011
T2 - 2011 IEEE Information Theory Workshop, ITW 2011
Y2 - 16 October 2011 through 20 October 2011
ER -