{'fraction_non_alphanumeric': 0.016666666666666666, 'fraction_numerical': 0.0, 'mean_word_length': 4.916666666666667, '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}}
Application of Reed-Muller Codes for Localization of Malicious Nodes

We consider a wireless network and address the problem of detecting and localizing malicious nodes in a single source/destination configuration. The malicious nodes are found through the use of Reed-Muller codes. Reed-Muller codes are used to select the necessary paths between source and destination. Based on the graph connectivity matrix, these necessary paths, and the probability that a node is malicious, our algorithm determines all the paths in the network. The minimum distance of the code determines how many malicious nodes can be localized. We develop an algorithm for the case when a set of paths is not realizable in the network and compare the performance of the algorithm with other techniques.