Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ISIT.2012.6283562 | ISIT |
Keywords | Field | DocType |
decoding procedure,decoder,independent short messages,multiple sources,codecs,channel coding,multicast message,nodes,discrete memoryless networks,long message repetitive encoding,short message noisy network coding,snnc,channel quality,network coding,decoding,noise measurement,encoding,artificial neural networks | Linear network coding,Channel code,Computer science,Multicast message,Computer network,Communication channel,Decoding methods,Codec,Encoding (memory) | Conference |
ISSN | ISBN | Citations |
2157-8095 E-ISBN : 978-1-4673-2578-3 | 978-1-4673-2578-3 | 5 |
PageRank | References | Authors |
0.43 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jie Hou | 1 | 97 | 4.39 |
| Gerhard Kramer | 2 | 445 | 34.21 |