CALCULATION OF THE NUMBER OF ARITHMETIC OPERATIONS IN ORDER TO FIND THE INVERSE MATRIX AND INCREASE THE RELIABILITY OF ACCEPTED SYMBOLS IN THE PERMUTATION DECODING ALGORITHM USING THE EXAMPLE OF THE HAMMING CODE (7, 4, 3)

Permutation decoding of group systematic noise-resistant codes makes it possible to maximize the use of redundancy inherent in the code, in comparance with other methods of digital data decoding. This solves the complex computational problem of finding the equivalent code needed to find the error vector. The most expensive part of the equivalent code searching algorithm is matrix transformations, in particular, the search for the inverse matrix. The idea of implementing a cognitive decoder card is described in the number of articles, but there are no calculations proving the multiplicity of winnings and showing the quantitative effectiveness of the proposed solution. In this work, we show the gain in the number of operations when using the cognitive card of the decoder. Also, the procedure for increasing the reliability of accepted symbols using the Score algorithm allows to avoid repeated permutation definitions and the calculation of an equivalent code.