摘要
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 e-achievable fixedlength coding rate subject to a fidelity criterion, extends a recent data compression theorem by Steinberg and Verdú.
| 原文 | English |
|---|---|
| 文章編號 | 681347 |
| 頁（從 - 到） | 1666-1668 |
| 頁數 | 3 |
| 期刊 | IEEE Transactions on Information Theory |
| 卷 | 44 |
| 發行號 | 4 |
| DOIs | |
| 出版狀態 | Published - 7月 1998 |