pith. machine review for the scientific record. sign in

arxiv: 1304.1692 · v2 · submitted 2013-04-05 · 💻 cs.IT · math.IT

Recognition: unknown

Short Message Noisy Network Coding with a Decode-Forward Option

Authors on Pith no claims yet
classification 💻 cs.IT math.IT
keywords messagesnnccodingdecodingnetworknoisyshortdecode-forward
0
0 comments X
read the original abstract

Short message noisy network coding (SNNC) differs from long message noisy network coding (LNNC) in that one transmits many short messages in blocks rather than using one long message with repetitive encoding. Several properties of SNNC are developed. First, SNNC with backward decoding achieves the same rates as SNNC with offset encoding and sliding window decoding for memoryless networks where each node transmits a multicast message. The rates are the same as LNNC with joint decoding. Second, SNNC enables early decoding if the channel quality happens to be good. This leads to mixed strategies that unify the advantages of decode-forward and noisy network coding. Third, the best decoders sometimes treat other nodes' signals as noise and an iterative method is given to find the set of nodes that a given node should treat as noise sources.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.