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 /spl epsiv/-achievable fixed-length coding rate subject to a fidelity criterion, extends a recent data compression...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 44; no. 4; pp. 1666 - 1668
Main Authors Po-Ning Chen, Alajaji, F.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.07.1998
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Block codes
Councils
Data compression
Entropy
Information theory
Mathematical models
Mathematics
Random processes
Rate-distortion
Source coding
Statistics
Theory
Online AccessGet full text
ISSN0018-9448
1557-9654
DOI10.1109/18.681347

Cover

More Information
Summary: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 /spl epsiv/-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).
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/18.681347