A rate-distortion theorem for arbitrary discrete sources

Po-Ning Chen; Fady Alajaji

doi:10.1109/18.681347

A rate-distortion theorem for arbitrary discrete sources

Po-Ning Chen^*, Fady Alajaji

^*Corresponding author for this work

Department of Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

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 e-achievable fixedlength coding rate subject to a fidelity criterion, extends a recent data compression theorem by Steinberg and Verdú.

Original language	English
Article number	681347
Pages (from-to)	1666-1668
Number of pages	3
Journal	IEEE Transactions on Information Theory
Volume	44
Issue number	4
DOIs	https://doi.org/10.1109/18.681347
State	Published - Jul 1998

Keywords

Arbitrary discrete sources
Data compression
Rate-distortion theory
Shannon theory

Access to Document

10.1109/18.681347

Cite this

@article{639c38930f7046ea82894560a3bda9cd,

title = "A rate-distortion theorem for arbitrary discrete sources",

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 e-achievable fixedlength coding rate subject to a fidelity criterion, extends a recent data compression theorem by Steinberg and Verd{\'u}.",

keywords = "Arbitrary discrete sources, Data compression, Rate-distortion theory, Shannon theory",

author = "Po-Ning Chen and Fady Alajaji",

year = "1998",

month = jul,

doi = "10.1109/18.681347",

language = "English",

volume = "44",

pages = "1666--1668",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - A rate-distortion theorem for arbitrary discrete sources

AU - Chen, Po-Ning

AU - Alajaji, Fady

PY - 1998/7

Y1 - 1998/7

N2 - 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ú.

AB - 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ú.

KW - Arbitrary discrete sources

KW - Data compression

KW - Rate-distortion theory

KW - Shannon theory

UR - http://www.scopus.com/inward/record.url?scp=0032123947&partnerID=8YFLogxK

U2 - 10.1109/18.681347

DO - 10.1109/18.681347

M3 - Article

AN - SCOPUS:0032123947

SN - 0018-9448

VL - 44

SP - 1666

EP - 1668

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 4

M1 - 681347

ER -

A rate-distortion theorem for arbitrary discrete sources

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this