Home > Research > Publications & Outputs > On the decoding failure probability of random n...

Research

Electronic data

  • VTC2019Spring_Chatzigeorgiou_paper

    Rights statement: ©2019 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, 395 KB, PDF document

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

Links

Text available via DOI:

View graph of relations

On the decoding failure probability of random network coded cooperation

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published
Close
More...
Publication date05/2019
Host publication2019 IEEE 89th Vehicular Technology Conference (VTC Spring)
PublisherIEEE
Number of pages5
<mark>Original language</mark>English
Event89th IEEE Vehicular Technology Conference - Kuala Lumpur, Malaysia
Duration: 28/04/2019 → 1/05/2019
http://www.ieeevtc.org/vtc2019spring/

Conference

Conference89th IEEE Vehicular Technology Conference
Abbreviated titleVTC2019-Spring
Country/TerritoryMalaysia
CityKuala Lumpur
Period28/04/19 → 1/05/19
Internet address

Conference

Conference89th IEEE Vehicular Technology Conference
Abbreviated titleVTC2019-Spring
Country/TerritoryMalaysia
CityKuala Lumpur
Period28/04/19 → 1/05/19
Internet address

Abstract

This paper considers a network of source nodes that transmit data packets to a destination node via relay nodes over erasure channels by using random linear network coding. The probability that the destination node will fail to recover the packets of all source nodes has been bounded and approximated in the literature for the case of relay nodes that randomly assign only nonzero values to the coefficients of linear combinations of data packets. The paper argues for the necessity of giving relay nodes the choice to also assign the zero value to coefficients when arithmetic operations are over finite fields of small size, e.g. GF(2). Alternative probability mass functions for the coefficients are considered, and expressions for the decoding failure probability are re-derived.

Bibliographic note

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