|
Problemy Peredachi Informatsii, 1999, Volume 35, Issue 4, Pages 29–46
(Mi ppi459)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Information Theory and Coding Theory
Asymptotic Distance Properties of Binary Woven Convolutional Codes
V. V. Zyablov, R. Johannesson, O. D. Skopintsev, S. Höst
Abstract:
Two constructions of binary concatenated convolutional codes are considered. In our previous work [Proc. 4th Int. Symp. Commun. Theory Appl., Lake District, UK (1997)] such codes were called woven convolutional codes. In the present paper, asymptotic lower bounds on active distances of woven convolutional codes are investigated. It is shown that these distances can be bounded from below by linearly growing functions with a strictly positive slope for all rates of concatenated codes, and the construction complexity of woven convolutional codes grows as an exponent of the memory of these codes.
Received: 19.11.1998
Citation:
V. V. Zyablov, R. Johannesson, O. D. Skopintsev, S. Höst, “Asymptotic Distance Properties of Binary Woven Convolutional Codes”, Probl. Peredachi Inf., 35:4 (1999), 29–46; Problems Inform. Transmission, 35:4 (1999), 311–326
Linking options:
https://www.mathnet.ru/eng/ppi459 https://www.mathnet.ru/eng/ppi/v35/i4/p29
|
Statistics & downloads: |
Abstract page: | 328 | Full-text PDF : | 104 | References: | 45 | First page: | 3 |
|