{'fraction_non_alphanumeric': 0.014379868184541641, 'fraction_numerical': 0.0, 'mean_word_length': 5.374045801526718, '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}}
PERMUTATION DECODING IN LOW-POWER WIRELESS SENSOR NETWORKS

Wireless sensor networks are currently considered for many subject areas as effective communication systems, including, for example, industrial and agricultural facilities and enterprises, monitoring of sensors of transport security systems, medicine applications, environmental and weather monitoring, etc. In such systems, the correction code (CC) is a classic approach used to increase the reliability of the data transmission channel while simultaneously reducing the required transmitted signal power, called the energy gain code. At the same time, the power of the transmitter is reduced due to additional power consumption in the receiver decoder. Stronger codes provide better performance with lower power requirements, but have more complex decoders with higher power consumption than relatively simple error control systems. If the additional power consumption at the output of the decoder exceeds the savings in transmitted power due to the use of CC, then such a code will not be energy efficient compared to a system with a non-redundant code. Various codes can be used to protect data, while the best codes for which the critical distance turns out to be large according to a number of studies are codes with a low parity check density. The paper proposes an alternative variant based on the synthesis of a permutation decoding system using the method of localization of a limited number of permutations and the organization of additional parity checks exclusively for the verification bits of the CC using the Bayesian approach to iterative transformations of integer soft solutions of symbols.