<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01807206</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-19T19:12:18+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Rate-Distortion Function for a Heegard-Berger Problem with Two Sources and Degraded Reconstruction sets</title>
            <author role="aut">
              <persName>
                <forename type="first">Meryem</forename>
                <surname>Benammar</surname>
              </persName>
              <idno type="halauthorid">780308-0</idno>
              <affiliation ref="#struct-431513"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Abdellatif</forename>
                <surname>Zaidi</surname>
              </persName>
              <email type="md5">68e441b7b445995957064005e9eee2fc</email>
              <email type="domain">univ-mlv.fr</email>
              <idno type="idhal" notation="numeric">942361</idno>
              <idno type="halauthorid" notation="string">625600-942361</idno>
              <affiliation ref="#struct-301243"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Abdellatif</forename>
                <surname>Zaidi</surname>
              </persName>
              <email type="md5">f9351f4658602d7505dbf0fc089635f8</email>
              <email type="domain">univ-eiffel.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-06-04 15:06:00</date>
              <date type="whenModified">2022-10-07 16:04:05</date>
              <date type="whenReleased">2018-06-04 15:06:00</date>
              <date type="whenProduced">2016-09-14</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/1508.06434"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="181068">
                <persName>
                  <forename>Abdellatif</forename>
                  <surname>Zaidi</surname>
                </persName>
                <email type="md5">f9351f4658602d7505dbf0fc089635f8</email>
                <email type="domain">univ-eiffel.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01807206</idno>
            <idno type="halUri">https://hal.science/hal-01807206</idno>
            <idno type="halBibtex">benammar:hal-01807206</idno>
            <idno type="halRefHtml">&lt;i&gt;IEEE Transactions on Information Theory&lt;/i&gt;, 2016, 62 (09), pp.5080-5092</idno>
            <idno type="halRef">IEEE Transactions on Information Theory, 2016, 62 (09), pp.5080-5092</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="ENPC" corresp="PARISTECH">École nationale des ponts et chaussées </idno>
            <idno type="stamp" n="LIGM_SIGNAL" corresp="LIGM">Signal and communications</idno>
            <idno type="stamp" n="PARISTECH">ParisTech</idno>
            <idno type="stamp" n="LIGM" corresp="ENPC">Laboratoire d'informatique Gaspard-Monge</idno>
            <idno type="stamp" n="CV_LIGM" corresp="CV_UNIV-MLV">CV des membres du LIGM</idno>
            <idno type="stamp" n="UNIV-EIFFEL">Université Gustave Eiffel</idno>
            <idno type="stamp" n="UPEM-UNIVEIFFEL">Université Paris-Est Marne-la-Vallée</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Submitted to IEEE Trans. on Information Theory</note>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Rate-Distortion Function for a Heegard-Berger Problem with Two Sources and Degraded Reconstruction sets</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Meryem</forename>
                    <surname>Benammar</surname>
                  </persName>
                  <idno type="halauthorid">780308-0</idno>
                  <affiliation ref="#struct-431513"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Abdellatif</forename>
                    <surname>Zaidi</surname>
                  </persName>
                  <email type="md5">68e441b7b445995957064005e9eee2fc</email>
                  <email type="domain">univ-mlv.fr</email>
                  <idno type="idhal" notation="numeric">942361</idno>
                  <idno type="halauthorid" notation="string">625600-942361</idno>
                  <affiliation ref="#struct-301243"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">5382</idno>
                <idno type="issn">0018-9448</idno>
                <title level="j">IEEE Transactions on Information Theory</title>
                <imprint>
                  <publisher>Institute of Electrical and Electronics Engineers</publisher>
                  <biblScope unit="volume">62</biblScope>
                  <biblScope unit="issue">09</biblScope>
                  <biblScope unit="pp">5080-5092</biblScope>
                  <date type="datePub">2016-09-14</date>
                </imprint>
              </monogr>
              <idno type="arxiv">1508.06434</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-it">Computer Science [cs]/Information Theory [cs.IT]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In this work, we investigate an instance of the Heegard-Berger problem with two sources and arbitrarily correlated side information sequences at two decoders, in which the reconstruction sets at the decoders are degraded. Specifically, two sources are to be encoded in a manner that one of the two is reproduced losslessly by both decoders, and the other is reproduced to within some prescribed distortion level at one of the two decoders. We establish a single-letter characterization of the rate-distortion function for this model. The investigation of this result in some special cases also sheds light on the utility of joint compression of the two sources. Furthermore, we also generalize our result to the setting in which the source component that is to be recovered by both users is reconstructed in a lossy fashion, under the requirement that all terminals (i.e., the encoder and both decoders) can share an exact copy of the compressed version of this source component, i.e., a common encoder-decoders reconstruction constraint. For this model as well, we establish a single-letter characterization of the associated rate-distortion function.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-431513" status="VALID">
          <idno type="ROR">https://ror.org/02rbzf697</idno>
          <orgName>Huawei Technologies France [Boulogne-Billancourt]</orgName>
          <desc>
            <address>
              <addrLine>Arcs de Seine18 quai du Point du JourCS 7000392100 Boulogne Billancourt</addrLine>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-301243" status="OLD">
          <idno type="IdRef">030820499</idno>
          <idno type="ISNI">0000000115124813</idno>
          <idno type="ROR">https://ror.org/02aqt9c37</idno>
          <orgName>Université Paris-Est Marne-la-Vallée</orgName>
          <orgName type="acronym">UPEM</orgName>
          <date type="start">1991-07-22</date>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>5 boulevard Descartes - Champs-sur-Marne - 77454 Marne-la-Vallée Cedex 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-pem.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>