A linear correspondence is developed between the states of a rate-k/nconvolutional encoderGand the states of a corresponding syndrome formerH^T, whereHis an encoder of the code dual to the code generated byG. This correspondence is used to find an expression for the number of all-zero paths of lengthtauin the code trellis; the answer depends only on the constraint lengths of the dual code. A partial answer to the resynchronization problem also falls out of this development.
Published in:
Information Theory, IEEE Transactions on
(Volume:19
,
Issue:
4
)
Date of Publication:
Jul 1973
- Page(s):
-
512
-
518
- ISSN :
-
0018-9448
- Digital Object Identifier :
-
10.1109/TIT.1973.1055030
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 January 2003
- Issue Date :
-
Jul 1973
- Sponsored by :
-
IEEE Information Theory Society