Abstract
Viterbi algorithm is simulated for ternary convolutional codes. Simulation results show that a decoding constraint length of 2 to 3 times the encoding constraint length is sufficient for levelling off the error probability at low cross-over probabilities of a ternary channel.