Efficiency of the error correction method by the parity values of binary matrix coordinates

In: Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series, Band 55, Heft 3, S. 375-382

Abstract

The results of study of the characteristics of the proposed method [1] for correction of errors arising during information transmission via communication lines are presented. The estimates of the efficiency of search for errors and the performance of an algorithm developed to realize the proposed method using the parity values of binary matrix coordinates are obtained; among these errors are rows, columns, main and auxiliary diagonals, are obtained. We have determined the dependence of algorithm characteristics on the intensity (density) of bit errors in the message obtained after transmission via communication lines and on the size of matrices, into which a transmitted message is divided.The time spent for calculating the parity values of matrix coordinates and for the algorithm used to find transmitted information errors are given. Recommendations on an optimal choice of sizes of binary matrices are presented. It is shown that, when the bit error rate is 10–2 and less, the algorithm detects all the available errors.