RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1985 Volume 21, Issue 3, Pages 28–35 (Mi ppi993)

Information Theory and Coding Theory

Synchronization of Isolated Words of MDS Codes in Noise

S. A. Popov


Abstract: The article considers synchronization of code words $(n,k)$ of maximum-distance separable codes (MDS codes) in the case of which each code arrives from the channel in noise. The author introduces the concept of the index of nonintersection at ${n-s}$ positions $(m_{n-s})$ as the minimum of the paired distances between ${n-s}$ symbol prefixes and ${n-s}$ symbol suffixes of code words under shift $s$. A method of constructing MDS codes with maximum $m_{n-s}$ values is given, as well as relations that make it possible to determine $P_{\rm{sun}}(s)$ (the probability of false synchronization) for them and to estimate $P_e(s)$ (the probability of error associated with false synchronization). Results of numerical computer calculations are presented.

UDC: 621.391.1:621.394.4

Received: 10.11.1983


 English version:
Problems of Information Transmission, 1985, 21:3, 185–192

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026