- 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

- https://ieeexplore.ieee.org/document/8746694
Final published version

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

Published

**On the decoding failure probability of random network coded cooperation.** / Chatzigeorgiou, Ioannis; Karabulut Kurt, Gunes; Tedik Basaran, Semiha; Saeed Khan, Amjad.

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

Chatzigeorgiou, I, Karabulut Kurt, G, Tedik Basaran, S & Saeed Khan, A 2019, On the decoding failure probability of random network coded cooperation. in *2019 IEEE 89th Vehicular Technology Conference (VTC Spring).* IEEE, 89th IEEE Vehicular Technology Conference, Kuala Lumpur, Malaysia, 28/04/19. https://doi.org/10.1109/VTCSpring.2019.8746694

Chatzigeorgiou, I., Karabulut Kurt, G., Tedik Basaran, S., & Saeed Khan, A. (2019). On the decoding failure probability of random network coded cooperation. In *2019 IEEE 89th Vehicular Technology Conference (VTC Spring) *IEEE. https://doi.org/10.1109/VTCSpring.2019.8746694

Chatzigeorgiou I, Karabulut Kurt G, Tedik Basaran S, Saeed Khan A. On the decoding failure probability of random network coded cooperation. In 2019 IEEE 89th Vehicular Technology Conference (VTC Spring). IEEE. 2019 https://doi.org/10.1109/VTCSpring.2019.8746694

@inproceedings{e337bf90b07b462da956a0e9e06e5f16,

title = "On the decoding failure probability of random network coded cooperation",

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.",

author = "Ioannis Chatzigeorgiou and {Karabulut Kurt}, Gunes and {Tedik Basaran}, Semiha and {Saeed Khan}, Amjad",

note = "{\circledC}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.",

year = "2019",

month = "5",

doi = "10.1109/VTCSpring.2019.8746694",

language = "English",

booktitle = "2019 IEEE 89th Vehicular Technology Conference (VTC Spring)",

publisher = "IEEE",

}

TY - GEN

T1 - On the decoding failure probability of random network coded cooperation

AU - Chatzigeorgiou, Ioannis

AU - Karabulut Kurt, Gunes

AU - Tedik Basaran, Semiha

AU - Saeed Khan, Amjad

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

PY - 2019/5

Y1 - 2019/5

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

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

U2 - 10.1109/VTCSpring.2019.8746694

DO - 10.1109/VTCSpring.2019.8746694

M3 - Conference contribution/Paper

BT - 2019 IEEE 89th Vehicular Technology Conference (VTC Spring)

PB - IEEE

ER -