Investigation on decoding failure probability in erasure network coded channels

In this paper wireless communications network is considered to transmit source information to destination. N number sources transmitting data to a destination receiver, through M relays nodes by employing random linear network coding (RLNC). Two methods of failure decoding probability on performance of wireless communication are explained and discussed in this paper. The major parameter that will impact on the decoding probability of RLNC are quantity of relays, a finite field size, and erasure probability. The comparison of two old bounds method (Seong's approach) and new bounds method (from Khan's approach) is explored in this research. Simulation results, shows that new bounds method on probability of decoding failure having better simulation results compared to old bound method. It is also concluded that calculating the bounds of the decoding probability is an easy method to analyze failure decoding probability compared to Chiasserini's approach method which is based on network coded matrix.