|
Problemy Peredachi Informatsii, 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.
Received: 10.11.1983
Citation:
S. A. Popov, “Synchronization of Isolated Words of MDS Codes in Noise”, Probl. Peredachi Inf., 21:3 (1985), 28–35; Problems Inform. Transmission, 21:3 (1985), 185–192
Linking options:
https://www.mathnet.ru/eng/ppi993 https://www.mathnet.ru/eng/ppi/v21/i3/p28
|
Statistics & downloads: |
Abstract page: | 179 | Full-text PDF : | 74 |
|