|
Problemy Peredachi Informatsii, 2012, Volume 48, Issue 1, Pages 26–36
(Mi ppi2066)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Coding Theory
Dual convolutional codes and the MacWilliams identities
I. E. Bocharovaa, F. Hugb, R. Johannessonb, B. D. Kudryashova a St. Petersburg State University of Information Technologies, Mechanics and Optics (ITMO)
b Lund University, Sweden
Abstract:
A recursion for sequences of spectra of truncated as well as tailbitten convolutional codes and their duals is derived. The order of this recursion is shown to be less than or equal to the rank of the weight adjacency matrix (WAM) for the minimal encoder of the convolutional code. It is sufficient to know finitely many spectra of these terminated convolutional codes in order to obtain an infinitely long sequence of spectra of their duals.
Received: 13.04.2011 Revised: 08.12.2011
Citation:
I. E. Bocharova, F. Hug, R. Johannesson, B. D. Kudryashov, “Dual convolutional codes and the MacWilliams identities”, Probl. Peredachi Inf., 48:1 (2012), 26–36; Problems Inform. Transmission, 48:1 (2012), 21–30
Linking options:
https://www.mathnet.ru/eng/ppi2066 https://www.mathnet.ru/eng/ppi/v48/i1/p26
|
Statistics & downloads: |
Abstract page: | 932 | Full-text PDF : | 139 | References: | 44 | First page: | 20 |
|