Decoding Network Codes by Message Passing

Simple item page
dc.creatorSalmond, Daniel
dc.creatorGrant, Alex
dc.creatorChan, Terence
dc.creatorGrivell, Ian
dc.date2009-02-03
dc.date2009-04-21
dc.date.accessioned2026-07-07T13:06:15Z
dc.date.available2026-07-07T13:06:15Z
dc.descriptionIn this paper, we show how to construct a factor graph from a network code. This provides a systematic framework for decoding using message passing algorithms. The proposed message passing decoder exploits knowledge of the underlying communications network topology to simplify decoding. For uniquely decodeable linear network codes on networks with error-free links, only the message supports (rather than the message values themselves) are required to be passed. This proposed simplified support message algorithm is an instance of the sum-product algorithm. Our message-passing framework provides a basis for the design of network codes and control of network topology with a view toward quantifiable complexity reduction in the sink terminals.
dc.description5 pages, submitted to ISIT 2009. Added an additional reference
dc.identifierhttps://arxiv.org/abs/0902.0417
dc.identifierhttp://arxiv.org/abs/0902.0417
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/227724
dc.subjectInformation Theory
dc.titleDecoding Network Codes by Message Passing
dc.typetext

Files

Collections

arXiv