This letter considers a multi-source multi-relay network in which relay nodes employ a coding scheme based on random linear network coding on source packets and generate coded packets. If a destination node collects enough coded packets, it can recover the packets of all source nodes. The links between source-to-relay nodes and relay-to-destination nodes are modeled as packet erasure channels. Improved bounds on the probability of decoding failure are presented, which are markedly close to simulation results and notably better than previous bounds. Examples demonstrate the tightness and usefulness of the new bounds over the old bounds.
Bibliographical note© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Khan, A. S., & Chatzigeorgiou , I. (2016). Improved Bounds on the Decoding Failure Probability of Network Coding Over Multi-Source Multi-Relay Networks. IEEE Communications Letters, 20(10), 2035-2038. https://doi.org/10.1109/LCOMM.2016.2594768