A rate-distortion theorem for arbitrary discrete sources
檔案
- 000074287700033.pdf (189.8 KB, Adobe PDF)
日期
1998-07-01
期刊名稱
IEEE TRANSACTIONS ON INFORMATION THEORY
摘要
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 epsilon-achievable fixed-length coding rate subject to a fidelity criterion, extends a recent data compression theorem by Steinberg and Verdu.