Prior to this thesis, a state assignment algorithm for a family of tail-biting trellis codes was presented (Lo, 1997; Lopez-Permouth, Dill and Lindsey, 2004). Based on this premise, this thesis develops and clarifies the algorithm for calculation of the initial states to a CTCM trellis by employing a source alphabet size of four. State mapping is necessary to be done before using the formula to calculate the initial states. In addition, the algorithm is implemented in computer programs of Matlab® and C++ that perform the calculation of the initial state for any given information sequence. Experimental results and analysis are provided for the performance comparisons. It is shown that various changes in CTCM parameters lead to expected corresponding changes in the bit error performance.