Abstract

We extend and generalize some earlier results [1] on syndrome decoding of binary rate-1/2 convolutional codes. Figure 1 represents a familiar example of such a code. The additions in Figure 1 are modulo-2 and all binary sequences ...,b−1,b0, b1,... are represented as power series b(α) = ... + b−1α-1 + b0 + b1α + .... The encoder has connection polynomials C1(α) = 1 + α2 and C2(α) = 1 + α + α2.

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 call

Disclaimer: 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.