|
Problemy Peredachi Informatsii, 1995, Volume 31, Issue 2, Pages 84–101
(Mi ppi278)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Coding Theory
Nonbinary Convolutional Coding in Channels with Jamming
K. Sh. Zigangirov, S. A. Popov, V. V. Chepyzhov
Abstract:
The characteristics of $q$-ary convolutional codes are investigated for the ensemble of codes where the codes are used for information transmission under the condition that there is artificial signal-like noise (jamming) in the channel and additive noise is absent. As a model of this channel, we consider the $J$-channel described below, which is a particular case of a discrete memoryless channel. A decoding algorithm of the convolutional codes is proposed. Upper estimates for the decoding error probability and the decoding complexity are derived for the ensemble of convolutional codes. Exponential-type estimates for the distribution function of the decoding complexity for the ensemble of trellis codes are derived as well. Results of simulation of convolutional codes based on the Reed–Solomon codes are presented.
Received: 16.06.1994
Citation:
K. Sh. Zigangirov, S. A. Popov, V. V. Chepyzhov, “Nonbinary Convolutional Coding in Channels with Jamming”, Probl. Peredachi Inf., 31:2 (1995), 84–101; Problems Inform. Transmission, 31:2 (1995), 169–183
Linking options:
https://www.mathnet.ru/eng/ppi278 https://www.mathnet.ru/eng/ppi/v31/i2/p84
|
Statistics & downloads: |
Abstract page: | 628 | Full-text PDF : | 283 |
|