Аннотация:
The existing approaches to frame synchronization of non-separable factorial code, as well as the reliable
transmission of its codewords, form the basis for creating a protocol for reliable permutation transmission
in conditions of intense channel noise and, accordingly, of a high probability of bit error. This study
considers a simplex data transmission system. For such a system, algorithms for frame synchronization of
permutations, as well as reliable transmission of permutations have been developed, providing processing
of fragments of bit sequences with a permutation length of M. A key feature of the proposed approaches is
that they are designed for situations where the initial moment of the transmitter’s syncword transmission
is unknown. It has been shown that to ensure the required level of false synchronization, the number of K
blocks, each consisting of l fragments, needs to be increased. An assessment of the probabilistic indicators
of the process of transmission and reception of information has been performed. Computer simulation
modeling has been carried out, confirming the theoretical results.
