Response to the following problem:
Consider the K = 3, rate 1/2, convolutional code shown in Figure . Suppose that the code is used on a binary symmetric channel and the received sequence for the first eight branches is 0001100000001001.
Trace the decisions on a trellis diagram, and label the survivors' Hamming distance metric at each node level. If a tie occurs in the metrics required for a decision, always choose the upper path (arbitrary choice).
