Data processing lower bounds for scalar lossy source codes with side information at the decoder

Avraham Reani; Neri Merhav

doi:https://doi.org/10.1109/ISIT.2012.6283651

Data processing lower bounds for scalar lossy source codes with side information at the decoder

Avraham Reani, Neri Merhav

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In this paper, we derive lower bounds on the distortion of scalar fixed-rate codes for lossy compression with side information available at the receiver. These bounds are derived by presenting the relevant random variables as a Markov chain and applying generalized data processing inequalities a la Ziv and Zakai.

Original language	English
Title of host publication	2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages	1-5
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2012.6283651
State	Published - 2012
Event	2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States Duration: 1 Jul 2012 → 6 Jul 2012

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings

Conference

Conference	2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/Territory	United States
City	Cambridge, MA
Period	1/07/12 → 6/07/12

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

https://doi.org/10.1109/ISIT.2012.6283651

Cite this

@inproceedings{3fa3f2570f464540a174ab468941658b,

title = "Data processing lower bounds for scalar lossy source codes with side information at the decoder",

abstract = "In this paper, we derive lower bounds on the distortion of scalar fixed-rate codes for lossy compression with side information available at the receiver. These bounds are derived by presenting the relevant random variables as a Markov chain and applying generalized data processing inequalities a la Ziv and Zakai.",

author = "Avraham Reani and Neri Merhav",

year = "2012",

doi = "https://doi.org/10.1109/ISIT.2012.6283651",

language = "الإنجليزيّة",

isbn = "9781467325790",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1--5",

booktitle = "2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012",

note = "2012 IEEE International Symposium on Information Theory, ISIT 2012 ; Conference date: 01-07-2012 Through 06-07-2012",

}

Reani, A & Merhav, N 2012, Data processing lower bounds for scalar lossy source codes with side information at the decoder. in 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012., 6283651, IEEE International Symposium on Information Theory - Proceedings, pp. 1-5, 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, United States, 1/07/12. https://doi.org/10.1109/ISIT.2012.6283651

Data processing lower bounds for scalar lossy source codes with side information at the decoder. / Reani, Avraham; Merhav, Neri.
2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. 2012. p. 1-5 6283651 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Data processing lower bounds for scalar lossy source codes with side information at the decoder

AU - Reani, Avraham

AU - Merhav, Neri

PY - 2012

Y1 - 2012

N2 - In this paper, we derive lower bounds on the distortion of scalar fixed-rate codes for lossy compression with side information available at the receiver. These bounds are derived by presenting the relevant random variables as a Markov chain and applying generalized data processing inequalities a la Ziv and Zakai.

AB - In this paper, we derive lower bounds on the distortion of scalar fixed-rate codes for lossy compression with side information available at the receiver. These bounds are derived by presenting the relevant random variables as a Markov chain and applying generalized data processing inequalities a la Ziv and Zakai.

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

U2 - https://doi.org/10.1109/ISIT.2012.6283651

DO - https://doi.org/10.1109/ISIT.2012.6283651

M3 - منشور من مؤتمر

SN - 9781467325790

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1

EP - 5

BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012

T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012

Y2 - 1 July 2012 through 6 July 2012

ER -

Data processing lower bounds for scalar lossy source codes with side information at the decoder

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this