Evaluation of ccomputational complexity and shortcomings of non-binary low density decoding algorithms

Operational requirements for processing, receiving and transmitting digital information devices constantly increase, due to the need to attract significant resources, especially intellectual. This is caused by the necessity to perform the tasks that are aimed at improving the efficiency of tools, methods and specific algorithms that implement processing, receiving and transmitting information technologies. One of the most dynamically developing approaches for solving the above problem is the coding theory, in particular noise-resistant coding. As far as the energy costs are concerned, the most effective noise-resistant codes are turbo codes and the codes with a low density of parity checks. The paper reviews the algorithms that allow the decoding of non-binary codes with a low density of parity, as well as the distribution algorithm and its modifications. Their significant drawbacks and major modifications applied to eliminate them are briefly overviewed in the paper; estimates of the computational complexity of the algorithms are given.