Dual convolutional codes and the MacWilliams identities
Author
Summary, in English
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.
Publishing year
2012
Language
English
Pages
21-30
Publication/Series
Problems of Information Transmission
Volume
48
Issue
1
Full text
- Available as PDF - 261 kB
- Download statistics
Document type
Journal article
Publisher
Springer
Topic
- Electrical Engineering, Electronic Engineering, Information Engineering
Status
Published
Research group
- Information Theory
ISBN/ISSN/Other
- ISSN: 0032-9460