Run length coding using standard run lengths has been proposed by Cherry et al [7]. Their analysis has been mostly experimental for specific types of data.
In this thesis the globally optimum single standard run length has been derived for the binary independent source and globally optimum single standard run lengths of zeros and ones have been derived for the binary first order Markov source. It is assumed that the output symbols are subsequently block coded in each case. A recursion relationship between standard run lengths is derived for two specific coding algorithms. A simple single standard run length scheme using a non-block code on the output symbols has also been derived for the binary independent source.
