Multiple description coding with many channels
An achievable region for the L-channel multiple description coding problem is presented. This region generalizes two-channel results of El Gamal and Cover (1982) and of Zhang and Berger (1987). It further generalizes three-channel results of Gray and Wyner (1974) and of Zhang and Berger. A source th...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2003-09, Vol.49 (9), p.2106-2114 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 2114 |
|---|---|
| container_issue | 9 |
| container_start_page | 2106 |
| container_title | IEEE transactions on information theory |
| container_volume | 49 |
| creator | Venkataramani, R. Kramer, G. Goyal, V.K. |
| description | An achievable region for the L-channel multiple description coding problem is presented. This region generalizes two-channel results of El Gamal and Cover (1982) and of Zhang and Berger (1987). It further generalizes three-channel results of Gray and Wyner (1974) and of Zhang and Berger. A source that is successively refinable on chains is shown to be successively refinable on trees. A new outer bound on the rate-distortion (RD) region for memoryless Gaussian sources with mean squared error distortion is also derived. The achievable region meets this outer bound for certain symmetric cases. |
| doi_str_mv | 10.1109/TIT.2003.815767 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_195882213</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1226597</ieee_id><sourcerecordid>901687946</sourcerecordid><originalsourceid>FETCH-LOGICAL-c390t-50f62d674d0c9cce5263a9531915897f24c5c81156d0c90b64c14040b1b68f573</originalsourceid><addsrcrecordid>eNp90E1Lw0AQBuBFFKzVswcvwYOeku7s7uzHUYofhYqXel7SzcZuSZOYTZD-e1MqCB48DQPPOzAvIddAMwBqZqvFKmOU8kwDKqlOyAQQVWokilMyoRR0aoTQ5-Qixu24CgQ2IdnrUPWhrXxS-Oi60PahqRPXFKH-SL5Cv0l2eb1P3Cava1_FS3JW5lX0Vz9zSt6fHlfzl3T59ryYPyxTxw3tU6SlZIVUoqDOOOeRSZ4b5GAAtVElEw6dBkB5AHQthQNBBV3DWuoSFZ-S--Pdtms-Bx97uwvR-arKa98M0RoKUisj5Cjv_pVMcym1xhHe_oHbZujq8QsLBrVmDPiIZkfkuibGzpe27cIu7_YWqD3UbMea7aFme6x5TNwcE8F7_6sZk2gU_wZWIHXw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195882213</pqid></control><display><type>article</type><title>Multiple description coding with many channels</title><source>IEEE Electronic Library (IEL)</source><creator>Venkataramani, R. ; Kramer, G. ; Goyal, V.K.</creator><creatorcontrib>Venkataramani, R. ; Kramer, G. ; Goyal, V.K.</creatorcontrib><description>An achievable region for the L-channel multiple description coding problem is presented. This region generalizes two-channel results of El Gamal and Cover (1982) and of Zhang and Berger (1987). It further generalizes three-channel results of Gray and Wyner (1974) and of Zhang and Berger. A source that is successively refinable on chains is shown to be successively refinable on trees. A new outer bound on the rate-distortion (RD) region for memoryless Gaussian sources with mean squared error distortion is also derived. The achievable region meets this outer bound for certain symmetric cases.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2003.815767</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Channels ; Codes ; Coding ; Decoding ; Distortion ; Error probability ; Errors ; Gaussian ; Information theory ; Random variables ; Rate-distortion ; Regions ; Source coding ; Speech coding ; Telecommunications ; Telephones ; Telephony ; Trees</subject><ispartof>IEEE transactions on information theory, 2003-09, Vol.49 (9), p.2106-2114</ispartof><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2003</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c390t-50f62d674d0c9cce5263a9531915897f24c5c81156d0c90b64c14040b1b68f573</citedby><cites>FETCH-LOGICAL-c390t-50f62d674d0c9cce5263a9531915897f24c5c81156d0c90b64c14040b1b68f573</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1226597$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1226597$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Venkataramani, R.</creatorcontrib><creatorcontrib>Kramer, G.</creatorcontrib><creatorcontrib>Goyal, V.K.</creatorcontrib><title>Multiple description coding with many channels</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>An achievable region for the L-channel multiple description coding problem is presented. This region generalizes two-channel results of El Gamal and Cover (1982) and of Zhang and Berger (1987). It further generalizes three-channel results of Gray and Wyner (1974) and of Zhang and Berger. A source that is successively refinable on chains is shown to be successively refinable on trees. A new outer bound on the rate-distortion (RD) region for memoryless Gaussian sources with mean squared error distortion is also derived. The achievable region meets this outer bound for certain symmetric cases.</description><subject>Channels</subject><subject>Codes</subject><subject>Coding</subject><subject>Decoding</subject><subject>Distortion</subject><subject>Error probability</subject><subject>Errors</subject><subject>Gaussian</subject><subject>Information theory</subject><subject>Random variables</subject><subject>Rate-distortion</subject><subject>Regions</subject><subject>Source coding</subject><subject>Speech coding</subject><subject>Telecommunications</subject><subject>Telephones</subject><subject>Telephony</subject><subject>Trees</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp90E1Lw0AQBuBFFKzVswcvwYOeku7s7uzHUYofhYqXel7SzcZuSZOYTZD-e1MqCB48DQPPOzAvIddAMwBqZqvFKmOU8kwDKqlOyAQQVWokilMyoRR0aoTQ5-Qixu24CgQ2IdnrUPWhrXxS-Oi60PahqRPXFKH-SL5Cv0l2eb1P3Cava1_FS3JW5lX0Vz9zSt6fHlfzl3T59ryYPyxTxw3tU6SlZIVUoqDOOOeRSZ4b5GAAtVElEw6dBkB5AHQthQNBBV3DWuoSFZ-S--Pdtms-Bx97uwvR-arKa98M0RoKUisj5Cjv_pVMcym1xhHe_oHbZujq8QsLBrVmDPiIZkfkuibGzpe27cIu7_YWqD3UbMea7aFme6x5TNwcE8F7_6sZk2gU_wZWIHXw</recordid><startdate>20030901</startdate><enddate>20030901</enddate><creator>Venkataramani, R.</creator><creator>Kramer, G.</creator><creator>Goyal, V.K.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20030901</creationdate><title>Multiple description coding with many channels</title><author>Venkataramani, R. ; Kramer, G. ; Goyal, V.K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c390t-50f62d674d0c9cce5263a9531915897f24c5c81156d0c90b64c14040b1b68f573</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Channels</topic><topic>Codes</topic><topic>Coding</topic><topic>Decoding</topic><topic>Distortion</topic><topic>Error probability</topic><topic>Errors</topic><topic>Gaussian</topic><topic>Information theory</topic><topic>Random variables</topic><topic>Rate-distortion</topic><topic>Regions</topic><topic>Source coding</topic><topic>Speech coding</topic><topic>Telecommunications</topic><topic>Telephones</topic><topic>Telephony</topic><topic>Trees</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Venkataramani, R.</creatorcontrib><creatorcontrib>Kramer, G.</creatorcontrib><creatorcontrib>Goyal, V.K.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Venkataramani, R.</au><au>Kramer, G.</au><au>Goyal, V.K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multiple description coding with many channels</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2003-09-01</date><risdate>2003</risdate><volume>49</volume><issue>9</issue><spage>2106</spage><epage>2114</epage><pages>2106-2114</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>An achievable region for the L-channel multiple description coding problem is presented. This region generalizes two-channel results of El Gamal and Cover (1982) and of Zhang and Berger (1987). It further generalizes three-channel results of Gray and Wyner (1974) and of Zhang and Berger. A source that is successively refinable on chains is shown to be successively refinable on trees. A new outer bound on the rate-distortion (RD) region for memoryless Gaussian sources with mean squared error distortion is also derived. The achievable region meets this outer bound for certain symmetric cases.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TIT.2003.815767</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2003-09, Vol.49 (9), p.2106-2114 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_proquest_journals_195882213 |
| source | IEEE Electronic Library (IEL) |
| subjects | Channels Codes Coding Decoding Distortion Error probability Errors Gaussian Information theory Random variables Rate-distortion Regions Source coding Speech coding Telecommunications Telephones Telephony Trees |
| title | Multiple description coding with many channels |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T03%3A07%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Multiple%20description%20coding%20with%20many%20channels&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Venkataramani,%20R.&rft.date=2003-09-01&rft.volume=49&rft.issue=9&rft.spage=2106&rft.epage=2114&rft.pages=2106-2114&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2003.815767&rft_dat=%3Cproquest_RIE%3E901687946%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195882213&rft_id=info:pmid/&rft_ieee_id=1226597&rfr_iscdi=true |