Short linear block codes can sometimes be represented efficiently by finite$-$length trellises with multiple initial and final states, in which each codeword corresponds to a tail$-$biting $($TB$)$ path with the same initial and final state.

Select one:

True

False