|
Problemy Peredachi Informatsii, 1989, Volume 25, Issue 4, Pages 98–102
(Mi ppi678)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Сorrespondence
Block Codes from Convolution Codes
B. D. Kudryashov, T. G. Zakharova
Abstract:
An ensemble of linear codes obtained by truncation of convolution codes is considered. Bounds on decoding complexity are derived.
Received: 17.11.1987 Revised: 07.04.1988
Citation:
B. D. Kudryashov, T. G. Zakharova, “Block Codes from Convolution Codes”, Probl. Peredachi Inf., 25:4 (1989), 98–102; Problems Inform. Transmission, 25:4 (1989), 336–339
Linking options:
https://www.mathnet.ru/eng/ppi678 https://www.mathnet.ru/eng/ppi/v25/i4/p98
|
Statistics & downloads: |
Abstract page: | 382 | Full-text PDF : | 182 |
|