The half a bit loss of robust source/channel codebooks

Ram Zamir

doi:10.1109/ITW.2002.1115433

The half a bit loss of robust source/channel codebooks

Ram Zamir^*

^*Corresponding author for this work

School of Electrical Engineering

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

4 Scopus citations

Abstract

We consider the problem of choosing robust codebooks for rate-distortion relative to difference distortion measures, and for capacity-cost relative to additive noise channels. We define an information theoretic formula for the min-max redundancy associated with robust random source codes, and similarly for the loss of robust random channel codes. We then show that this min-max performance can be approached by structured, dithered lattice codebooks. Applications to coding with side information are discussed.

Original language	English
Title of host publication	Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	123-126
Number of pages	4
ISBN (Electronic)	0780376293, 9780780376298
DOIs	https://doi.org/10.1109/ITW.2002.1115433
State	Published - 2002
Event	2002 IEEE Information Theory Workshop, ITW 2002 - Bangalore, India Duration: 20 Oct 2002 → 25 Oct 2002

Publication series

Name	Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002

Conference

Conference	2002 IEEE Information Theory Workshop, ITW 2002
Country/Territory	India
City	Bangalore
Period	20/10/02 → 25/10/02

Access to Document

10.1109/ITW.2002.1115433

Cite this

@inproceedings{5e1349d04eea4a03aa31cb96f239ed76,

title = "The half a bit loss of robust source/channel codebooks",

abstract = "We consider the problem of choosing robust codebooks for rate-distortion relative to difference distortion measures, and for capacity-cost relative to additive noise channels. We define an information theoretic formula for the min-max redundancy associated with robust random source codes, and similarly for the loss of robust random channel codes. We then show that this min-max performance can be approached by structured, dithered lattice codebooks. Applications to coding with side information are discussed.",

author = "Ram Zamir",

note = "Publisher Copyright: {\textcopyright} 2002 IEEE.; 2002 IEEE Information Theory Workshop, ITW 2002 ; Conference date: 20-10-2002 Through 25-10-2002",

year = "2002",

doi = "10.1109/ITW.2002.1115433",

language = "אנגלית",

series = "Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002",

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

pages = "123--126",

booktitle = "Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002",

address = "ארצות הברית",

}

Zamir, R 2002, The half a bit loss of robust source/channel codebooks. in Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002., 1115433, Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002, Institute of Electrical and Electronics Engineers Inc., pp. 123-126, 2002 IEEE Information Theory Workshop, ITW 2002, Bangalore, India, 20/10/02. https://doi.org/10.1109/ITW.2002.1115433

The half a bit loss of robust source/channel codebooks. / Zamir, Ram.
Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002. Institute of Electrical and Electronics Engineers Inc., 2002. p. 123-126 1115433 (Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002).

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

TY - GEN

T1 - The half a bit loss of robust source/channel codebooks

AU - Zamir, Ram

PY - 2002

Y1 - 2002

N2 - We consider the problem of choosing robust codebooks for rate-distortion relative to difference distortion measures, and for capacity-cost relative to additive noise channels. We define an information theoretic formula for the min-max redundancy associated with robust random source codes, and similarly for the loss of robust random channel codes. We then show that this min-max performance can be approached by structured, dithered lattice codebooks. Applications to coding with side information are discussed.

AB - We consider the problem of choosing robust codebooks for rate-distortion relative to difference distortion measures, and for capacity-cost relative to additive noise channels. We define an information theoretic formula for the min-max redundancy associated with robust random source codes, and similarly for the loss of robust random channel codes. We then show that this min-max performance can be approached by structured, dithered lattice codebooks. Applications to coding with side information are discussed.

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

U2 - 10.1109/ITW.2002.1115433

DO - 10.1109/ITW.2002.1115433

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:2642584055

T3 - Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002

SP - 123

EP - 126

BT - Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2002 IEEE Information Theory Workshop, ITW 2002

Y2 - 20 October 2002 through 25 October 2002

ER -

The half a bit loss of robust source/channel codebooks

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this