A rate-distortion theorem for arbitrary discrete sources
| dc.citation.epage | 1668 | en_US |
| dc.citation.issue | 4 | en_US |
| dc.citation.spage | 1666 | en_US |
| dc.citation.volume | 44 | en_US |
| dc.contributor.author | Chen, PN | en_US |
| dc.contributor.author | Alajaji, F | en_US |
| dc.contributor.department | 電信工程研究所 | zh_TW |
| dc.contributor.department | Institute of Communications Engineering | en_US |
| dc.date.accessioned | 2014-12-08T15:48:54Z | |
| dc.date.available | 2014-12-08T15:48:54Z | |
| dc.date.issued | 1998-07-01 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.identifier.doi | 10.1109/18.681347 | en_US |
| dc.identifier.issn | 0018-9448 | en_US |
| dc.identifier.journal | IEEE TRANSACTIONS ON INFORMATION THEORY | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1109/18.681347 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/32523 | |
| dc.identifier.wosnumber | WOS:000074287700033 | |
| dc.language.iso | en_US | en_US |
| dc.subject | arbitrary discrete sources | en_US |
| dc.subject | data compression | en_US |
| dc.subject | rate-distortion theory | en_US |
| dc.subject | Shannon theory | en_US |
| dc.title | A rate-distortion theorem for arbitrary discrete sources | en_US |
| dc.type | Article; Proceedings Paper | en_US |