Home > Research > Publications & Outputs > Probability of partially decoding network-coded...

Electronic data

  • CL2017_0828_CameraReady

    Accepted author manuscript, 136 KB, PDF document

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

Links

Text available via DOI:

View graph of relations

Probability of partially decoding network-coded messages

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Probability of partially decoding network-coded messages. / Claridge, Jessica; Chatzigeorgiou, Ioannis.
In: IEEE Communications Letters, Vol. 21, No. 9, 09.2017, p. 1945-1948.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Claridge, J & Chatzigeorgiou, I 2017, 'Probability of partially decoding network-coded messages', IEEE Communications Letters, vol. 21, no. 9, pp. 1945-1948. https://doi.org/10.1109/LCOMM.2017.2704110

APA

Vancouver

Claridge J, Chatzigeorgiou I. Probability of partially decoding network-coded messages. IEEE Communications Letters. 2017 Sept;21(9):1945-1948. Epub 2017 May 15. doi: 10.1109/LCOMM.2017.2704110

Author

Claridge, Jessica ; Chatzigeorgiou, Ioannis. / Probability of partially decoding network-coded messages. In: IEEE Communications Letters. 2017 ; Vol. 21, No. 9. pp. 1945-1948.

Bibtex

@article{be45552f4c404207a39d968ae406394c,
title = "Probability of partially decoding network-coded messages",
abstract = "In the literature there exists analytical expressions for the probability of a receiver decoding a transmitted source message that has been encoded using random linear network coding. In this work, we look into the probability that the receiver will decode at least a fraction of the source message, and present an exact solution to this problem for both non-systematic and systematic network coding. Based on the derived expressions, we investigate the potential of these two implementations of network coding for information-theoretic secure communication and progressive recovery of data.",
author = "Jessica Claridge and Ioannis Chatzigeorgiou",
note = "{\textcopyright}2017 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 = "2017",
month = sep,
doi = "10.1109/LCOMM.2017.2704110",
language = "English",
volume = "21",
pages = "1945--1948",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

RIS

TY - JOUR

T1 - Probability of partially decoding network-coded messages

AU - Claridge, Jessica

AU - Chatzigeorgiou, Ioannis

N1 - ©2017 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 - 2017/9

Y1 - 2017/9

N2 - In the literature there exists analytical expressions for the probability of a receiver decoding a transmitted source message that has been encoded using random linear network coding. In this work, we look into the probability that the receiver will decode at least a fraction of the source message, and present an exact solution to this problem for both non-systematic and systematic network coding. Based on the derived expressions, we investigate the potential of these two implementations of network coding for information-theoretic secure communication and progressive recovery of data.

AB - In the literature there exists analytical expressions for the probability of a receiver decoding a transmitted source message that has been encoded using random linear network coding. In this work, we look into the probability that the receiver will decode at least a fraction of the source message, and present an exact solution to this problem for both non-systematic and systematic network coding. Based on the derived expressions, we investigate the potential of these two implementations of network coding for information-theoretic secure communication and progressive recovery of data.

U2 - 10.1109/LCOMM.2017.2704110

DO - 10.1109/LCOMM.2017.2704110

M3 - Journal article

VL - 21

SP - 1945

EP - 1948

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 9

ER -