Home > Research > Publications & Outputs > Improved bounds on the decoding failure probabi...

Electronic data

  • CL2016_1346_CameraReady

    Rights statement: ©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.

    Accepted author manuscript, 252 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Text available via DOI:

View graph of relations

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

Research output: Contribution to journalJournal article

Published

Standard

Improved bounds on the decoding failure probability of network coding over multi-source multi-relay networks. / Khan, Amjad Saeed; Chatzigeorgiou, Ioannis.

In: IEEE Communications Letters, Vol. 20, No. 10, 10.2016, p. 2035-2038.

Research output: Contribution to journalJournal article

Harvard

APA

Vancouver

Author

Bibtex

@article{5c4f9eab7f914234b64e148a61cf9916,
title = "Improved bounds on the decoding failure probability of network coding over multi-source multi-relay networks",
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.",
keywords = "network coding, random matrices, relay channel",
author = "Khan, {Amjad Saeed} and Ioannis Chatzigeorgiou",
note = "{\circledC}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.",
year = "2016",
month = "10",
doi = "10.1109/LCOMM.2016.2594768",
language = "English",
volume = "20",
pages = "2035--2038",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

RIS

TY - JOUR

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

AU - Khan, Amjad Saeed

AU - Chatzigeorgiou, Ioannis

N1 - ©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.

PY - 2016/10

Y1 - 2016/10

N2 - 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.

AB - 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.

KW - network coding

KW - random matrices

KW - relay channel

U2 - 10.1109/LCOMM.2016.2594768

DO - 10.1109/LCOMM.2016.2594768

M3 - Journal article

VL - 20

SP - 2035

EP - 2038

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 10

ER -