{'fraction_non_alphanumeric': 0.02617801047120419, 'fraction_numerical': 0.0, 'mean_word_length': 5.248366013071895, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Efficient multi-source network coding using low rank parity check code

Network coding (NC) is one of the promising high-performance techniques for wireless sensor networks (WSNs). However, few works have focused on the concerns of multi-source networks using error correcting codes. When an intermediate node fails errors may occur and since NC combines packets from different sources, several packets can be affected. In this paper, we propose a modified-low rank parity check (M-LRPC) decoding algorithm for a scenario with multiple source nodes. Furthermore, we investigate the performance of the proposed coding technique in terms of success decoding rate. Then, we derive an analytical expression for the decoding probability of the proposed M-LRPC. Simulation results are conducted in order to validate our analytical findings. These results show that the proposed scheme significantly improves the decoding probability compared to Gabidulin codes.