TY - GEN
T1 - Short message noisy network coding for multiple sources
AU - Hou, Jie
AU - Kramer, Gerhard
PY - 2012
Y1 - 2012
N2 - Short message noisy network coding (SNNC) transmits independent short messages in blocks rather than using long message repetitive encoding. SNNC is shown to achieve the same rates as noisy network coding (NNC) for discrete memoryless networks where each node transmits a multicast message. One advantage of SNNC is that backward decoding may be used which simplifies the analysis and understanding of the achievability proof. The analysis reveals that each decoder may ignore certain other nodes rather than including their message in the decoding procedure. Additionally, SNNC enables early decoding at nodes if the channel quality happens to be good.
AB - Short message noisy network coding (SNNC) transmits independent short messages in blocks rather than using long message repetitive encoding. SNNC is shown to achieve the same rates as noisy network coding (NNC) for discrete memoryless networks where each node transmits a multicast message. One advantage of SNNC is that backward decoding may be used which simplifies the analysis and understanding of the achievability proof. The analysis reveals that each decoder may ignore certain other nodes rather than including their message in the decoding procedure. Additionally, SNNC enables early decoding at nodes if the channel quality happens to be good.
UR - http://www.scopus.com/inward/record.url?scp=84867488406&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2012.6283562
DO - 10.1109/ISIT.2012.6283562
M3 - Conference contribution
AN - SCOPUS:84867488406
SN - 9781467325790
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1677
EP - 1681
BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012
Y2 - 1 July 2012 through 6 July 2012
ER -