A long period quasi-random sequences false synchronization probability estimation under organized interference conditions

It is known that the broadband communication systems functioning always begins with a long period quasi-random sequences sensors synchronization. In a false synchronization case, which is immediately detected by the received signal convolution absence, resynchronization can be carried out in organized interference difficult conditions from the intruders' side. By now, a false start probability estimating issues remain open due to the obtaining mathematical expressions' difficulty without knowing the errors' distribution laws that lead to false start of a long period quasi-random sequences sensors synchronization. In this paper, theorems are proved on a long period quasi-random sequences sensors synchronization process isomorphism by the Ward method to the check relations fulfilment (k+m, k) of the maximum length code, which makes it possible using the coding theory theoretical apparatus to obtain fairly simple mathematical expressions for calculating a long period quasi-random sequences sensors synchronization false synchronization probability through the maximum length code undetected error (k+m, k) probability.