DocumentCode
1387115
Title
A rate-distortion theorem for arbitrary discrete sources
Author
Chen, Po-Ning ; Alajaji, Fady
Author_Institution
Dept. of Commun. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan
Volume
44
Issue
4
fYear
1998
fDate
7/1/1998 12:00:00 AM
Firstpage
1666
Lastpage
1668
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 ε-achievable fixed-length coding rate subject to a fidelity criterion, extends a recent data compression theorem by Steinberg and Verdu (see ibid., vol.42, p.63-86 (Jan. 1996)
Keywords
block codes; rate distortion theory; source coding; arbitrary discrete sources; data compression; discrete-time finite-alphabet sources; fidelity criterion; minimum ϵ-achievable fixed-length coding rate; rate-distortion theorem; source coding; Block codes; Councils; Data compression; Entropy; Information theory; Mathematics; Random processes; Rate-distortion; Source coding; Statistics;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.681347
Filename
681347
Link To Document