Probl. Peredachi Inf., 1989 Volume 25, Issue 4, Pages 98–102
(Mi ppi678)
|
This article is cited 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.
UDC:
621.391.15
Received: 17.11.1987
Revised: 07.04.1988
English version:
Problems of Information Transmission, 1989,
25:4,
336–339
Bibliographic databases:
© , 2024
Fulltext:
PDF file (613 kB)