Improved bounds on the decoding failure probability of network coding over multi-source multi-relay networks

Khan, Amjad Saeed and Chatzigeorgiou, Ioannis (2016) Improved bounds on the decoding failure probability of network coding over multi-source multi-relay networks. IEEE Communications Letters, 20 (10). pp. 2035-2038. ISSN 1089-7798

[img]
Preview
PDF (CL2016_1346_CameraReady)
2016_IEEECommLett_Khan.pdf - Accepted Version
Available under License Creative Commons Attribution.

Download (258kB)

Abstract

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.

Item Type:
Journal Article
Journal or Publication Title:
IEEE Communications Letters
Additional Information:
©2016 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2200/2208
Subjects:
ID Code:
80580
Deposited By:
Deposited On:
28 Jul 2016 15:04
Refereed?:
Yes
Published?:
Published
Last Modified:
29 Nov 2020 03:49