Comparison of Time Codes for Source Encoding
T. J. Lynch · IRE Transactions on Communications Systems · 1974
The time information for source-encoded, or compressed, sampled time functions is treated as a two-symbol source, the symbols corresponding to redundant and nonredundant samples. The entropy of this source for both the statistically independent symbol model and the Markov model is used as a reference for the comparison of time codes. Time encoding schemes are classified into two categories: total information codes and partial information codes. The following codes are compared on the basis of the number of timing bits per symbol as a function of the compression ratio: binary sequence code, Lynch-Davisson code, time-of-nonredundant-sample code, cluster code, fixed-length binary run-length code, Huffman code, and the binary-nonconsective-one code.