Title :
Tree coding of discrete-time abstract alphabet stationary block-ergodic sources with a fidelity criterion
fDate :
11/1/1976 12:00:00 AM
Abstract :
A tree coding theorem is established for discrete-time abstract alphabet stationary block-ergodic sources under a single-letter fidelity criterion. The proof of this theorem uses recent results from the theory of branching processes with random environments. The relation to previous work in tree coding is also discussed.
Keywords :
Rate-distortion theory; Tree codes; Block codes; Channel capacity; Decoding; Encoding; Equations; Information theory; Rate-distortion; Reliability theory; Source coding; Testing;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1976.1055641
