Fast Algorithms for Digital Signal Processing
Fast Algorithms for Digital Signal Processing
Fundamentals of Convolutional Coding
Fundamentals of Convolutional Coding
A MacWilliams identity for convolutional codes: the general case
IEEE Transactions on Information Theory
On the MacWilliams Identity for Convolutional Codes
IEEE Transactions on Information Theory
Codes on Graphs: Duality and MacWilliams Identities
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.