Title :
Tree encoding of stationary ergodic sources with a fidelity criterion
Author :
Hashimoto, Takeshi
fDate :
9/1/1983 12:00:00 AM
Abstract :
Tree source coding theorems with a single letter fidelity criterion are proved for stationary ergodic sources using tree codes with a fixed branch length. The higher-than-exponential convergence of distortions is shown for binary symmetric sources and Hamming distortion measure when an excess in rate is allowed.
Keywords :
Autoregressive processes; Gaussian processes; Rate-distortion theory; Source coding; Tree coding; Approximation algorithms; Convergence; Convolutional codes; Distortion measurement; Encoding; Information theory; Regression tree analysis; Sorting; Source coding; Speech;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1983.1056740