pith. sign in

arxiv: 1209.1679 · v3 · pith:JWXPP4ZMnew · submitted 2012-09-08 · 💻 cs.IT · math.IT

Bayesian Quantized Network Coding via Belief Propagation

classification 💻 cs.IT math.IT
keywords codingnetworkquantizedbelieferrormessagespacketspropagation
0
0 comments X
read the original abstract

In this paper, we propose an alternative for routing based packet forwarding, which uses network coding to increase transmission efficiency, in terms of both compression and error resilience. This non-adaptive encoding is called quantized network coding, which involves random linear mapping in the real field, followed by quantization to cope with the finite capacity of the links. At the gateway node, which collects received quantized network coder packets, minimum mean squared error decoding is performed, by using belief propagation in the factor graph representation. Our simulation results show a significant improvement, in terms of the number of required packets to recover the messages, which can be interpreted as an embedded distributed source coding for correlated messages.

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.