Convolution Codes

Consider a convolutional code with R $=1=3,$ and octal generators $(1$; $3$; $2).$ Determine and draw the tree and the

state diagrams of the code.

Determine the code word associated to the information sequence: $010101100.$

Determine the bit$-$error probability $($considering at least $3$ non zero terms in the union bound$),$ and the minimal

bandwidth required in case of an information bit$-$rate equal to $10$ Mbit$/$sec$.$