RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2012 Volume 48, Issue 1, Pages 26–36 (Mi ppi2066)

This article is cited 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.

UDC: 621.391.15

Received: 13.04.2011
Revised: 08.12.2011


 English version:
Problems of Information Transmission, 2012, 48:1, 21–30

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025