|
Problemy Peredachi Informatsii, 1990, Volume 26, Issue 2, Pages 18–26
(Mi ppi602)
|
|
|
|
Information Theory and Coding Theory
Decoding of Block Codes Obtained from Convolution Codes
B. D. Kudryashov
Abstract:
We consider block codes obtained from convolution codes by truncation with “tail biting.” A decoding algorithm is proposed. We show that for these codes the asymptotic tradeoff relationships between error probability and decoding complexity are the same as for convolution codes with Viterbi decoding.
Received: 13.06.1988 Revised: 15.05.1989
Citation:
B. D. Kudryashov, “Decoding of Block Codes Obtained from Convolution Codes”, Probl. Peredachi Inf., 26:2 (1990), 18–26; Problems Inform. Transmission, 26:2 (1990), 104–111
Linking options:
https://www.mathnet.ru/eng/ppi602 https://www.mathnet.ru/eng/ppi/v26/i2/p18
|
Statistics & downloads: |
Abstract page: | 324 | Full-text PDF : | 279 |
|