AustralieFrV1, PascalFrancis, Curation, bibRecord, 005C25

Source Coding Problems With Conditionally Less Noisy Side Information

Identifieur interne : 005C25 ( PascalFrancis/Curation ); précédent : 005C24; suivant : 005C26

Source Coding Problems With Conditionally Less Noisy Side Information

Auteurs : Roy Timo [Australie] ; Tobias J. Oechtering [Suède] ; Michèle Wigger [France]

Source :

IEEE transactions on information theory [ 0018-9448 ] ; 2014.

RBID : Pascal:14-0244764

Descripteurs français

Pascal (Inist)
- Codage source, Théorie vitesse distorsion, Théorie information, Source sans mémoire, Canal avec bruit, Canal radiodiffusion, Approche déterministe, Méthode raffinement.

English descriptors

KwdEn :
- Broadcast channels, Deterministic approach, Information theory, Memoryless source, Noisy channel, Rate distortion theory, Refinement method, Source coding.

Abstract

A computable expression for Heegard and Berger's rate-distortion function has eluded information theory for nearly three decades. Heegard and Berger's single-letter achievability bound is well known to be optimal for physically degraded side information; however, it is not known whether the bound is optimal for arbitrarily correlated side information (general discrete memoryless sources). In this paper, we consider a new setup where the side information at one receiver is conditionally less noisy than that at the other. The new setup includes degraded side information as a special case, and it is motivated by the literature on degraded and less noisy broadcast channels. Our key contribution is a converse proving the optimality of Heegard and Berger's achievability bound in a new setting, where the side information is conditionally less noisy and one distortion function is deterministic. The less noisy setup is also generalized to two different successive-refinement problems.

A01	`01`	`1`		`@0 0018-9448`
A02	`01`			`@0 IETTAW`
A03		`1`		`@0 IEEE trans. inf. theory`
A05				`@2 60`
A06				`@2 9`
A08	`01`	`1`	`ENG`	`@1 Source Coding Problems With Conditionally Less Noisy Side Information`
A11	`01`	`1`		`@1 TIMO (Roy)`
A11	`02`	`1`		`@1 OECHTERING (Tobias J.)`
A11	`03`	`1`		`@1 WIGGER (Michèle)`
A14	`01`			`@1 Institute for Telecommunications Research, University of South Australia @2 Adelaide, SA 5000 @3 AUS @Z 1 aut.`
A14	`02`			`@1 Access Linnaeus Center, School of Electrical Engineering, KTH Royal Institute of Technology @2 Stockholm 10044 @3 SWE @Z 2 aut.`
A14	`03`			`@1 Department of Communications and Electrical Engineering, Telecom ParisTech @2 Paris 75014 @3 FRA @Z 3 aut.`
A20				`@1 5516-5532`
A21				`@1 2014`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 222F9 @5 354000504508330290`
A44				`@0 0000 @1 © 2014 INIST-CNRS. All rights reserved.`
A45				`@0 32 ref.`
A47	`01`	`1`		`@0 14-0244764`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 IEEE transactions on information theory`
A66	`01`			`@0 USA`
C01	`01`		`ENG`	@0 A computable expression for Heegard and Berger's rate-distortion function has eluded information theory for nearly three decades. Heegard and Berger's single-letter achievability bound is well known to be optimal for physically degraded side information; however, it is not known whether the bound is optimal for arbitrarily correlated side information (general discrete memoryless sources). In this paper, we consider a new setup where the side information at one receiver is conditionally less noisy than that at the other. The new setup includes degraded side information as a special case, and it is motivated by the literature on degraded and less noisy broadcast channels. Our key contribution is a converse proving the optimality of Heegard and Berger's achievability bound in a new setting, where the side information is conditionally less noisy and one distortion function is deterministic. The less noisy setup is also generalized to two different successive-refinement problems.
C02	`01`	`X`		`@0 001D04A03`
C02	`02`	`X`		`@0 001D04A04B`
C02	`03`	`X`		`@0 001D04B06D`
C03	`01`	`3`	`FRE`	`@0 Codage source @5 01`
C03	`01`	`3`	`ENG`	`@0 Source coding @5 01`
C03	`02`	`3`	`FRE`	`@0 Théorie vitesse distorsion @5 02`
C03	`02`	`3`	`ENG`	`@0 Rate distortion theory @5 02`
C03	`03`	`X`	`FRE`	`@0 Théorie information @5 03`
C03	`03`	`X`	`ENG`	`@0 Information theory @5 03`
C03	`03`	`X`	`SPA`	`@0 Teoría información @5 03`
C03	`04`	`X`	`FRE`	`@0 Source sans mémoire @5 04`
C03	`04`	`X`	`ENG`	`@0 Memoryless source @5 04`
C03	`04`	`X`	`SPA`	`@0 Fuente sin memoria @5 04`
C03	`05`	`X`	`FRE`	`@0 Canal avec bruit @5 05`
C03	`05`	`X`	`ENG`	`@0 Noisy channel @5 05`
C03	`05`	`X`	`SPA`	`@0 Canal con ruido @5 05`
C03	`06`	`3`	`FRE`	`@0 Canal radiodiffusion @5 06`
C03	`06`	`3`	`ENG`	`@0 Broadcast channels @5 06`
C03	`07`	`X`	`FRE`	`@0 Approche déterministe @5 07`
C03	`07`	`X`	`ENG`	`@0 Deterministic approach @5 07`
C03	`07`	`X`	`SPA`	`@0 Enfoque determinista @5 07`
C03	`08`	`X`	`FRE`	`@0 Méthode raffinement @5 08`
C03	`08`	`X`	`ENG`	`@0 Refinement method @5 08`
C03	`08`	`X`	`SPA`	`@0 Método afinamiento @5 08`
N21				`@1 293`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000239

Links to Exploration step

Pascal:14-0244764

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Source Coding Problems With Conditionally Less Noisy Side Information</title>
<author><name sortKey="Timo, Roy" sort="Timo, Roy" uniqKey="Timo R" first="Roy" last="Timo">Roy Timo</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institute for Telecommunications Research, University of South Australia</s1>
<s2>Adelaide, SA 5000</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Australie</country>
</affiliation>
</author>
<author><name sortKey="Oechtering, Tobias J" sort="Oechtering, Tobias J" uniqKey="Oechtering T" first="Tobias J." last="Oechtering">Tobias J. Oechtering</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Access Linnaeus Center, School of Electrical Engineering, KTH Royal Institute of Technology</s1>
<s2>Stockholm 10044</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Suède</country>
</affiliation>
</author>
<author><name sortKey="Wigger, Michele" sort="Wigger, Michele" uniqKey="Wigger M" first="Michèle" last="Wigger">Michèle Wigger</name>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Department of Communications and Electrical Engineering, Telecom ParisTech</s1>
<s2>Paris 75014</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">14-0244764</idno>
<date when="2014">2014</date>
<idno type="stanalyst">PASCAL 14-0244764 INIST</idno>
<idno type="RBID">Pascal:14-0244764</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000239</idno>
<idno type="wicri:Area/PascalFrancis/Curation">005C25</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Source Coding Problems With Conditionally Less Noisy Side Information</title>
<author><name sortKey="Timo, Roy" sort="Timo, Roy" uniqKey="Timo R" first="Roy" last="Timo">Roy Timo</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institute for Telecommunications Research, University of South Australia</s1>
<s2>Adelaide, SA 5000</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Australie</country>
</affiliation>
</author>
<author><name sortKey="Oechtering, Tobias J" sort="Oechtering, Tobias J" uniqKey="Oechtering T" first="Tobias J." last="Oechtering">Tobias J. Oechtering</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Access Linnaeus Center, School of Electrical Engineering, KTH Royal Institute of Technology</s1>
<s2>Stockholm 10044</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Suède</country>
</affiliation>
</author>
<author><name sortKey="Wigger, Michele" sort="Wigger, Michele" uniqKey="Wigger M" first="Michèle" last="Wigger">Michèle Wigger</name>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Department of Communications and Electrical Engineering, Telecom ParisTech</s1>
<s2>Paris 75014</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">IEEE transactions on information theory</title>
<title level="j" type="abbreviated">IEEE trans. inf. theory</title>
<idno type="ISSN">0018-9448</idno>
<imprint><date when="2014">2014</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">IEEE transactions on information theory</title>
<title level="j" type="abbreviated">IEEE trans. inf. theory</title>
<idno type="ISSN">0018-9448</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Broadcast channels</term>
<term>Deterministic approach</term>
<term>Information theory</term>
<term>Memoryless source</term>
<term>Noisy channel</term>
<term>Rate distortion theory</term>
<term>Refinement method</term>
<term>Source coding</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Codage source</term>
<term>Théorie vitesse distorsion</term>
<term>Théorie information</term>
<term>Source sans mémoire</term>
<term>Canal avec bruit</term>
<term>Canal radiodiffusion</term>
<term>Approche déterministe</term>
<term>Méthode raffinement</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">A computable expression for Heegard and Berger's rate-distortion function has eluded information theory for nearly three decades. Heegard and Berger's single-letter achievability bound is well known to be optimal for physically degraded side information; however, it is not known whether the bound is optimal for arbitrarily correlated side information (general discrete memoryless sources). In this paper, we consider a new setup where the side information at one receiver is conditionally less noisy than that at the other. The new setup includes degraded side information as a special case, and it is motivated by the literature on degraded and less noisy broadcast channels. Our key contribution is a converse proving the optimality of Heegard and Berger's achievability bound in a new setting, where the side information is conditionally less noisy and one distortion function is deterministic. The less noisy setup is also generalized to two different successive-refinement problems.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0018-9448</s0>
</fA01>
<fA02 i1="01"><s0>IETTAW</s0>
</fA02>
<fA03 i2="1"><s0>IEEE trans. inf. theory</s0>
</fA03>
<fA05><s2>60</s2>
</fA05>
<fA06><s2>9</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Source Coding Problems With Conditionally Less Noisy Side Information</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>TIMO (Roy)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>OECHTERING (Tobias J.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>WIGGER (Michèle)</s1>
</fA11>
<fA14 i1="01"><s1>Institute for Telecommunications Research, University of South Australia</s1>
<s2>Adelaide, SA 5000</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Access Linnaeus Center, School of Electrical Engineering, KTH Royal Institute of Technology</s1>
<s2>Stockholm 10044</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>Department of Communications and Electrical Engineering, Telecom ParisTech</s1>
<s2>Paris 75014</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>5516-5532</s1>
</fA20>
<fA21><s1>2014</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>222F9</s2>
<s5>354000504508330290</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2014 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>32 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>14-0244764</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>IEEE transactions on information theory</s0>
</fA64>
<fA66 i1="01"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>A computable expression for Heegard and Berger's rate-distortion function has eluded information theory for nearly three decades. Heegard and Berger's single-letter achievability bound is well known to be optimal for physically degraded side information; however, it is not known whether the bound is optimal for arbitrarily correlated side information (general discrete memoryless sources). In this paper, we consider a new setup where the side information at one receiver is conditionally less noisy than that at the other. The new setup includes degraded side information as a special case, and it is motivated by the literature on degraded and less noisy broadcast channels. Our key contribution is a converse proving the optimality of Heegard and Berger's achievability bound in a new setting, where the side information is conditionally less noisy and one distortion function is deterministic. The less noisy setup is also generalized to two different successive-refinement problems.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D04A03</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D04A04B</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001D04B06D</s0>
</fC02>
<fC03 i1="01" i2="3" l="FRE"><s0>Codage source</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="3" l="ENG"><s0>Source coding</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="3" l="FRE"><s0>Théorie vitesse distorsion</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="3" l="ENG"><s0>Rate distortion theory</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Théorie information</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Information theory</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Teoría información</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Source sans mémoire</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Memoryless source</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Fuente sin memoria</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Canal avec bruit</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Noisy channel</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Canal con ruido</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="3" l="FRE"><s0>Canal radiodiffusion</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="3" l="ENG"><s0>Broadcast channels</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Approche déterministe</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Deterministic approach</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Enfoque determinista</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Méthode raffinement</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Refinement method</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Método afinamiento</s0>
<s5>08</s5>
</fC03>
<fN21><s1>293</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/PascalFrancis/Curation

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005C25 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 005C25 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Asie
   |area=    AustralieFrV1
   |flux=    PascalFrancis
   |étape=   Curation
   |type=    RBID
   |clé=     Pascal:14-0244764
   |texte=   Source Coding Problems With Conditionally Less Noisy Side Information
}}

This area was generated with Dilib version V0.6.33.
Data generation: Tue Dec 5 10:43:12 2017. Site generation: Tue Mar 5 14:07:20 2024

	Serveur d'exploration sur les relations entre la France et l'Australie
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur les relations entre la France et l'Australie

Source Coding Problems With Conditionally Less Noisy Side Information

Source Coding Problems With Conditionally Less Noisy Side Information

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri