A Rate-Distortion Theorem for Arbitrary Discrete Sources

— A rate-distortion theorem for arbitrary (not necessarily stationary or ergodic) discrete-time finite-alphabet sources is given. This result, which provides the expression of the minimum -achievable fixedlength coding rate subject to a fidelity criterion, extends a recent data compression theorem by Steinberg and Verd´u.

• Type: Journal
• Year: 1998
• Where: TIT
• Authors: Po-Ning Chen, Fady Alajaji
• Keywords: Data Compression Theorem, Minimum -achievable fixedlength, Rate-distortion Theorem, TIT 1998