Decoding forward error correction code in a priori uncertainty

The purpose of research is to increase the efficiency of decoding noise–resistant block codes in conditions of a priori uncertainty about the parameters used. Methods . In modern systems, the use of noise-resistant block codes with a large codeword length is noted, which allows the permitted code combinations to be sufficiently far apart from each other during encoding and to obtain, during iterative decoding, the possibility of their correct determination at low values of the signal-to-noise ratio in the communication channel. The use of long noise-tolerant codes requires a reduction in the complexity of error correction algorithms, which is estimated by the number of operations of various types per decoding iteration. The number of operations of various types will depend on the parameters of the code and the verification matrix, as well as the decoding algorithm used. The practical implementation of the decoder has a number of limitations, and its design is a difficult task, especially in conditions of a priori uncertainty about the applied code parameters. To solve this problem, it is proposed to use the method of determining the applied LBC verification matrix based on the analysis of the received digital sequence. Results. In the course of the study, a comparative analysis of known methods for determining the parameters of an interference-resistant block code was carried out and a modification of the Gauss method was proposed to solve a system of linear algebraic equations when finding the LBC verification matrix. Conclusion . The proposed method avoids performing a strict sequence of actions according to the well-known Gauss method, as well as reducing time complexity by paralleling calculations and significantly increasing the efficiency of practical implementation of the algorithm for finding the LBC verification matrix.