For arbitrary alphabets and single-letter fidelity criteria, two theorems are given which allow any fixed-rate or variable-rate source coding theorem for block codes to be extended to sliding-block codes. Applications are given to universal coding and to the coding of a stationary nonergodic source.
No takes yet. Share an insight, caveat, or question.
John C. Kieffer (1980) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: