Extension of source coding theorems for block codes to sliding-block codes
John C. Kieffer · IEEE Transactions on Information Theory · 1980
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.