Abstract
We show what choice there is in assigning output digits to transitions of a binary rate 1/n code trellis so that the latter will correspond to a convolutional code. We then prove that in any rate \frac{1}{2} noncatastrophic code of constraint length \upsilon each binary sequence of length 2j (1 \leq j \leq \upsilon - 1) is associated with exactly 2^{\upsilon -j -1} distinct paths j branches long. As a consequence of the above properties nondegenerate codes with branch complementarity are fully determined by the topological relationship of the trellis transitions associated with output pairs 00. Finally, we derive a new upper bound on free distance of rate 1/n convolutional codes and use our results to determine the length of the largest input sequence that can conceivably result in an output whose weight is
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
