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.
|Title of host publication||89th IEEE Vehicular Technology Conference|
|Number of pages||5|
|Publication status||Published - 27 Jun 2019|
|Event||2019 IEEE 89th Vehicular Technology Conference - Kuala Lumpur, Malaysia|
Duration: 28 Apr 2019 → 1 May 2019
Conference number: 89
|Conference||2019 IEEE 89th Vehicular Technology Conference|
|Period||28/04/19 → 1/05/19|
Bibliographical note© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Chatzigeorgiou, I., Karabulut Kurt, G., Tedik Basaran, S., & Khan, A. S. (2019). On the Decoding Failure Probability of Random Network Coded Cooperation. In 89th IEEE Vehicular Technology Conference IEEE. https://doi.org/10.1109/VTCSpring.2019.8746694