Two-Way Source Coding With a Helper

Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the region of achievable rates and distortions when the Markov relation (Helper)-(User 1)-(User 2) holds. The main insight of th...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 56; no. 6; pp. 2905 - 2919
Main Authors: Permuter, Haim H, Steinberg, Yossef, Weissman, Tsachy
Format: Journal Article
Language:English
Published: New York IEEE 01.06.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Decoders
Decoding
Distortion
Encoders
Encoding
Error analysis
Gaussian
Information processing
Information systems
Information theory
Markov analysis
Markov processes
Messages
Normal distribution
Optimization
Peer to peer computing
Protocols
Rate-distortion
Source coding
Theory
two-way rate distortion
undirected graphs
verification of Markov relations
Wyner-Ziv source coding
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the region of achievable rates and distortions when the Markov relation (Helper)-(User 1)-(User 2) holds. The main insight of the result is that in order to achieve the optimal rate, the helper may use a binning scheme, as in Wyner-Ziv, where the side information at the decoder is the ¿further¿ user, namely, User 2. We derive these regions explicitly for the Gaussian sources with square error distortion, analyze a tradeoff between the rate from the helper and the rate from the source, and examine a special case where the helper has the freedom to send different messages, at different rates, to the encoder and the decoder. The converse proofs use a technique for verifying Markov relations via undirected graphs.
AbstractList Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the region of achievable rates and distortions when the Markov relation (Helper)-(User 1)-(User 2) holds. The main insight of the result is that in order to achieve the optimal rate, the helper may use a binning scheme, as in Wyner-Ziv, where the side information at the decoder is the 'further' user, namely, User 2. We derive these regions explicitly for the Gaussian sources with square error distortion, analyze a tradeoff between the rate from the helper and the rate from the source, and examine a special case where the helper has the freedom to send different messages, at different rates, to the encoder and the decoder. The converse proofs use a technique for verifying Markov relations via undirected graphs.
Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the region of achievable rates and distortions when the Markov relation (Helper)-(User 1)-(User 2) holds. The main insight of the result is that in order to achieve the optimal rate, the helper may use a binning scheme, as in Wyner-Ziv, where the side information at the decoder is the ...further... user, namely, User 2. We derive these regions explicitly for the Gaussian sources with square error distortion, analyze a tradeoff between the rate from the helper and the rate from the source, and examine a special case where the helper has the freedom to send different messages, at different rates, to the encoder and the decoder. The converse proofs use a technique for verifying Markov relations via undirected graphs. (ProQuest: ... denotes formulae/symbols omitted.)
Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the region of achievable rates and distortions when the Markov relation (Helper)-(User 1)-(User 2) holds. The main insight of the result is that in order to achieve the optimal rate, the helper may use a binning scheme, as in Wyner-Ziv, where the side information at the decoder is the ¿further¿ user, namely, User 2. We derive these regions explicitly for the Gaussian sources with square error distortion, analyze a tradeoff between the rate from the helper and the rate from the source, and examine a special case where the helper has the freedom to send different messages, at different rates, to the encoder and the decoder. The converse proofs use a technique for verifying Markov relations via undirected graphs.
Author Weissman, Tsachy
Permuter, Haim H
Steinberg, Yossef
Author_xml – sequence: 1
  givenname: Haim H
  surname: Permuter
  fullname: Permuter, Haim H
  email: haimp@bgu.ac.il
  organization: Dept. of Electr. & Comput. Eng. Dept., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel
– sequence: 2
  givenname: Yossef
  surname: Steinberg
  fullname: Steinberg, Yossef
  email: ysteinbe@ee.technion.ac.il
  organization: Dept. of Electr. Eng., Technion - Israel Inst. of Technol., Haifa, Israel
– sequence: 3
  givenname: Tsachy
  surname: Weissman
  fullname: Weissman, Tsachy
  email: tsachy@stanford.edu
  organization: Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA
BookMark eNp9kE1LAzEQhoMo2FbvgpdFD5625nuToxS1hYIHV3oMaXZWU7abutki_femtHjowdPwwvMMM-8QnbehBYRuCB4TgvVjOSvHFKdEMZeUqTM0IEIUuZaCn6MBxkTlmnN1iYYxrlLkgtABui9_Qr6wu-w9bDsH2SRUvv3MFr7_ymw2hWYD3RW6qG0T4fo4R-jj5bmcTPP52-ts8jTPHaO0z13NKcNVQSUXirlCLemSAqs0K2pGauu0ZsRJBUIoSqXmhC2xctJWWgkOmI3Qw2HvpgvfW4i9WfvooGlsC2EbTSFYwTgmOpF3J-Qqnd-m44zAHGOenkuQPECuCzF2UBvne9v70Pad9Y0h2OybM6k5s2_OHJtLIj4RN51f2273n3J7UDwA_OGCSymoZr85FXa7
CODEN IETTAW
CitedBy_id crossref_primary_10_1109_TIT_2013_2288256
crossref_primary_10_1109_TIT_2016_2533479
crossref_primary_10_1109_TIT_2016_2621749
crossref_primary_10_1109_TIT_2011_2165804
crossref_primary_10_1109_TIT_2018_2884490
crossref_primary_10_1109_TIT_2015_2476800
crossref_primary_10_1109_TIT_2015_2499759
crossref_primary_10_1109_TIT_2011_2145570
crossref_primary_10_1109_TIT_2012_2188273
crossref_primary_10_1109_TIT_2013_2245394
crossref_primary_10_1109_TIT_2018_2883295
crossref_primary_10_1002_ett_2665
crossref_primary_10_1109_TIT_2016_2570011
crossref_primary_10_1109_TIT_2019_2921764
crossref_primary_10_3390_e19090467
crossref_primary_10_1109_TIT_2021_3100781
Cites_doi 10.1109/18.641555
10.1109/ITW.2006.322888
10.1109/ISIT.2007.4557477
10.1109/18.32119
10.1109/TIT.1975.1055469
10.1109/TIT.1982.1056586
10.1109/TIT.2002.806135
10.1109/TIT.1976.1055508
10.1109/TIT.2008.920343
10.1109/TIT.2008.928295
10.1016/S0019-9958(78)90034-7
10.1109/TIT.2006.871047
10.1109/TIT.1975.1055374
10.1109/TIT.2005.850110
10.1109/TIT.1985.1057118
10.1109/JPROC.2004.839619
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2010
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2010
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
DOI 10.1109/TIT.2010.2046238
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Technology Research Database
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1557-9654
EndPage 2919
ExternalDocumentID 2061786241
10_1109_TIT_2010_2046238
5466529
Genre orig-research
Feature
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACGFS
ACGOD
ACIWK
AENEX
AETEA
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
F5P
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IDIHD
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNS
RXW
TAE
TN5
VH1
VJK
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
RIG
F28
FR3
ID FETCH-LOGICAL-c322t-cf4230d7264583c78b2b2e3d937f31fac9931c68e5582269413b08c6ad9854e03
IEDL.DBID RIE
ISICitedReferencesCount 26
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000277880200031&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0018-9448
IngestDate Sun Sep 28 02:53:04 EDT 2025
Sun Jun 29 12:54:03 EDT 2025
Tue Nov 18 22:26:23 EST 2025
Sat Nov 29 03:53:09 EST 2025
Tue Aug 26 16:40:05 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 6
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c322t-cf4230d7264583c78b2b2e3d937f31fac9931c68e5582269413b08c6ad9854e03
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 504004451
PQPubID 36024
PageCount 15
ParticipantIDs ieee_primary_5466529
crossref_citationtrail_10_1109_TIT_2010_2046238
proquest_journals_504004451
crossref_primary_10_1109_TIT_2010_2046238
proquest_miscellaneous_753734019
PublicationCentury 2000
PublicationDate 2010-June
2010-06-00
20100601
PublicationDateYYYYMMDD 2010-06-01
PublicationDate_xml – month: 06
  year: 2010
  text: 2010-June
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on information theory
PublicationTitleAbbrev TIT
PublicationYear 2010
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
ref20
ref11
ref10
ref21
pearl (ref16) 2000
ref2
ref1
ref17
ref8
jordan (ref18) 1999
ref7
ref4
ref3
permuter (ref9) 2008
ref5
kaspi (ref6) 1979
cover (ref19) 2006
csiszr (ref22) 1981
References_xml – ident: ref11
  doi: 10.1109/18.641555
– ident: ref14
  doi: 10.1109/ITW.2006.322888
– year: 2000
  ident: ref16
  publication-title: Causality Models Reasoning and Inference
– ident: ref8
  doi: 10.1109/ISIT.2007.4557477
– ident: ref10
  doi: 10.1109/18.32119
– ident: ref5
  doi: 10.1109/TIT.1975.1055469
– year: 2006
  ident: ref19
  publication-title: Elements of Information Theory
– ident: ref7
  doi: 10.1109/TIT.1982.1056586
– year: 2008
  ident: ref9
  publication-title: Rate-distortion with a limited-rate helper to the encoder and decoder
– ident: ref17
  doi: 10.1109/TIT.2002.806135
– year: 1999
  ident: ref18
  publication-title: Learning in Graphical Models
– ident: ref3
  doi: 10.1109/TIT.1976.1055508
– ident: ref13
  doi: 10.1109/TIT.2008.920343
– ident: ref21
  doi: 10.1109/TIT.2008.928295
– ident: ref20
  doi: 10.1016/S0019-9958(78)90034-7
– year: 1981
  ident: ref22
  publication-title: Information Theory Coding Theorems for Discrete Memoryless Systems
– ident: ref15
  doi: 10.1109/TIT.2006.871047
– ident: ref4
  doi: 10.1109/TIT.1975.1055374
– ident: ref12
  doi: 10.1109/TIT.2005.850110
– ident: ref1
  doi: 10.1109/TIT.1985.1057118
– ident: ref2
  doi: 10.1109/JPROC.2004.839619
– year: 1979
  ident: ref6
  publication-title: Rate-distortion for correlated sources with partially separated encoders Ph D dissertation
SSID ssj0014512
Score 2.1276543
Snippet Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 2905
SubjectTerms Decoders
Decoding
Distortion
Encoders
Encoding
Error analysis
Gaussian
Information processing
Information systems
Information theory
Markov analysis
Markov processes
Messages
Normal distribution
Optimization
Peer to peer computing
Protocols
Rate-distortion
Source coding
Theory
two-way rate distortion
undirected graphs
verification of Markov relations
Wyner-Ziv source coding
Title Two-Way Source Coding With a Helper
URI https://ieeexplore.ieee.org/document/5466529
https://www.proquest.com/docview/504004451
https://www.proquest.com/docview/753734019
Volume 56
WOSCitedRecordID wos000277880200031&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1557-9654
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014512
  issn: 0018-9448
  databaseCode: RIE
  dateStart: 19630101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFH_M4UEPTjfFOpWAXgTr0iZp06MMh16GYGW7lTZNcSDt2DrF_94k_WCgCN4KTUp5Ly_v974BrjHjvptRqgea6JIcltlcSGEnXkpTmulDlphhE_50yufz4LkDt20tjJTSJJ_JO_1oYvlpITbaVTZi1POYG-zAju97Va1WGzGgzKk6gztKgJXN0YQkcTAKn8Iqh8vVlZi6EmVLBZmZKj8uYqNdJr3__dchHNQoEt1XbD-Cjsz70GsmNKBaYPuwv9VucABX4Wdhz-Iv9GI89mhcaMWFZovyDcVIKaClXB3D6-QhHD_a9ZAEWyhZLG2RKUCEU18BG8aJ8HniJq4kqYIdGXGyWCgA4giPS8YUFtBlqyTBXHhxGnBGJSYn0M2LXJ4CokR4VEG8OCGMEim4l0mM4xSLWGYJcy0YNXSLRN1BXA-yeI-MJYGDSFE60pSOakpbcNPuWFbdM_5YO9CUbdfVRLVg2LAmqsVrHTFz9SiWW4Dat0oudLAjzmWxWUfKDPOJMh6Ds9-_O4S9KhFAO1TOoVuuNvICdsVHuVivLs3Z-gZxZ8gF
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED_mFNQHv8U5PwL6IliXNUmbPoo4NpxDsLK9hTZNcSDr2DrF_94k7YqgCL4VmpRyl8v97hvgEjPuuymlZqCJKclhqcOlkk7sJTShqTlksR024Q8GfDQKnmpwXdXCKKVs8pm6MY82lp9kcmFcZS1GPY-5wQqsMkpdXFRrVTEDytpFb_C2FmFtdSyDkjhohb2wyOJyTS2mqUX5poTsVJUfV7HVL53t__3ZDmyVOBLdFozfhZqa7MH2ckYDKkV2Dza_NRzch4vwI3OG0Sd6tj57dJcZ1YWG4_wVRUiroKmaHcBL5z686zrlmARHamnMHZlqSIQTX0Mbxon0eezGriKJBh4paaeR1BCkLT2uGNNowBSukhhz6UVJwBlVmBxCfZJN1BEgSqRHNciLYsIoUZJ7qcI4SrCMVBoztwGtJd2ELHuIm1EWb8LaEjgQmtLCUFqUlG7AVbVjWvTP-GPtvqFsta4kagOaS9aIUsDmgtnLR7O8Aah6qyXDhDuiicoWc6ENMZ9o8zE4_v2757DeDR_7ot8bPDRho0gLMO6VE6jns4U6hTX5no_nszN7zr4AB2bLTA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Two-Way+Source+Coding+With+a+Helper&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Permuter%2C+HH&rft.au=Steinberg%2C+Y&rft.au=Weissman%2C+T&rft.date=2010-06-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=56&rft.issue=6&rft.spage=2905&rft_id=info:doi/10.1109%2FTIT.2010.2046238&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2061786241
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon