Near sufficiency of random coding for two descriptions
We give a single-letter outer bound for the two-descriptions problem for independent and identically distributed (i.i.d.) sources that is universally close to the El Gamal and Cover (EGC) inner bound. The gaps for the sum and individual rates using a quadratic distortion measure are upper-bounded by...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2006-02, Vol.52 (2), p.681-695 |
|---|---|
| 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 | 695 |
|---|---|
| container_issue | 2 |
| container_start_page | 681 |
| container_title | IEEE transactions on information theory |
| container_volume | 52 |
| creator | Lastras-Montano, L.A. Castelli, V. |
| description | We give a single-letter outer bound for the two-descriptions problem for independent and identically distributed (i.i.d.) sources that is universally close to the El Gamal and Cover (EGC) inner bound. The gaps for the sum and individual rates using a quadratic distortion measure are upper-bounded by 1.5 and 0.5 bits/sample, respectively, and are universal with respect to the source being encoded and the desired distortion levels. Variants of our basic ideas are presented, including upper and lower bounds on the second channel's rate when the first channel's rate is arbitrarily close to the rate-distortion function; these bounds differ, in the limit as the code block length goes to infinity, by not more than 2 bits/sample. An interesting aspect of our methodology is the manner in which the matching single-letter outer bound is obtained, as we eschew common techniques for constructing single-letter bounds in favor of new ideas in the field of rate loss bounds. We expect these techniques to be generally applicable to other settings of interest. |
| doi_str_mv | 10.1109/TIT.2005.862073 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TIT_2005_862073</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1580802</ieee_id><sourcerecordid>983900621</sourcerecordid><originalsourceid>FETCH-LOGICAL-c382t-6706734b3cf51858c3bd21cb2a07362946d8950a8a9d4503bb4afa912c06b2063</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWKtnD14WQfGybb43OUrxo1D0Us8hm00kZbupyS7Sf2_KFgQPnoZhnnmZeQC4RnCGEJTz9XI9wxCymeAYVuQETBBjVSk5o6dgAiESpaRUnIOLlDa5pQzhCeBvVsciDc55421n9kVwRdRdE7aFCY3vPgsXYtF_h6KxyUS_633o0iU4c7pN9upYp-Dj-Wm9eC1X7y_LxeOqNETgvuQV5BWhNTGOIcGEIXWDkamxzhdyLClvhGRQCy0byiCpa6qdlggbyGsMOZmC-zF3F8PXYFOvtj4Z27a6s2FICgtIKRIygw__gohXCJNshGT09g-6CUPs8hsKSSYRJfyQNx8hE0NK0Tq1i36r414hqA6-VfatDr7V6Dtv3B1jdTK6dVmi8el3raKUcYwzdzNy3lr7O2YCCojJDy2UhcQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195914369</pqid></control><display><type>article</type><title>Near sufficiency of random coding for two descriptions</title><source>IEEE Electronic Library (IEL)</source><creator>Lastras-Montano, L.A. ; Castelli, V.</creator><creatorcontrib>Lastras-Montano, L.A. ; Castelli, V.</creatorcontrib><description>We give a single-letter outer bound for the two-descriptions problem for independent and identically distributed (i.i.d.) sources that is universally close to the El Gamal and Cover (EGC) inner bound. The gaps for the sum and individual rates using a quadratic distortion measure are upper-bounded by 1.5 and 0.5 bits/sample, respectively, and are universal with respect to the source being encoded and the desired distortion levels. Variants of our basic ideas are presented, including upper and lower bounds on the second channel's rate when the first channel's rate is arbitrarily close to the rate-distortion function; these bounds differ, in the limit as the code block length goes to infinity, by not more than 2 bits/sample. An interesting aspect of our methodology is the manner in which the matching single-letter outer bound is obtained, as we eschew common techniques for constructing single-letter bounds in favor of new ideas in the field of rate loss bounds. We expect these techniques to be generally applicable to other settings of interest.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2005.862073</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Blocking ; Codes ; Coding ; Coding, codes ; Communication channels ; Communication systems ; Construction ; Converses ; Data compression ; Descriptions ; Distortion ; Distortion measurement ; Distribution ; dithering ; Entropy ; Exact sciences and technology ; Explosions ; Gaps ; H infinity control ; Infinity ; Information, signal and communications theory ; lossy coding ; Lower bounds ; multiple descriptions (MD) ; Mutual information ; random coding ; Rate distortion theory ; rate loss ; Rate-distortion ; Signal and communications theory ; Source coding ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Transmission and modulation (techniques and equipments) ; two descriptions ; universal bounds</subject><ispartof>IEEE transactions on information theory, 2006-02, Vol.52 (2), p.681-695</ispartof><rights>2006 INIST-CNRS</rights><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Feb 2006</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c382t-6706734b3cf51858c3bd21cb2a07362946d8950a8a9d4503bb4afa912c06b2063</citedby><cites>FETCH-LOGICAL-c382t-6706734b3cf51858c3bd21cb2a07362946d8950a8a9d4503bb4afa912c06b2063</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1580802$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1580802$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17445622$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Lastras-Montano, L.A.</creatorcontrib><creatorcontrib>Castelli, V.</creatorcontrib><title>Near sufficiency of random coding for two descriptions</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>We give a single-letter outer bound for the two-descriptions problem for independent and identically distributed (i.i.d.) sources that is universally close to the El Gamal and Cover (EGC) inner bound. The gaps for the sum and individual rates using a quadratic distortion measure are upper-bounded by 1.5 and 0.5 bits/sample, respectively, and are universal with respect to the source being encoded and the desired distortion levels. Variants of our basic ideas are presented, including upper and lower bounds on the second channel's rate when the first channel's rate is arbitrarily close to the rate-distortion function; these bounds differ, in the limit as the code block length goes to infinity, by not more than 2 bits/sample. An interesting aspect of our methodology is the manner in which the matching single-letter outer bound is obtained, as we eschew common techniques for constructing single-letter bounds in favor of new ideas in the field of rate loss bounds. We expect these techniques to be generally applicable to other settings of interest.</description><subject>Applied sciences</subject><subject>Blocking</subject><subject>Codes</subject><subject>Coding</subject><subject>Coding, codes</subject><subject>Communication channels</subject><subject>Communication systems</subject><subject>Construction</subject><subject>Converses</subject><subject>Data compression</subject><subject>Descriptions</subject><subject>Distortion</subject><subject>Distortion measurement</subject><subject>Distribution</subject><subject>dithering</subject><subject>Entropy</subject><subject>Exact sciences and technology</subject><subject>Explosions</subject><subject>Gaps</subject><subject>H infinity control</subject><subject>Infinity</subject><subject>Information, signal and communications theory</subject><subject>lossy coding</subject><subject>Lower bounds</subject><subject>multiple descriptions (MD)</subject><subject>Mutual information</subject><subject>random coding</subject><subject>Rate distortion theory</subject><subject>rate loss</subject><subject>Rate-distortion</subject><subject>Signal and communications theory</subject><subject>Source coding</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Transmission and modulation (techniques and equipments)</subject><subject>two descriptions</subject><subject>universal bounds</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kE1LAzEQhoMoWKtnD14WQfGybb43OUrxo1D0Us8hm00kZbupyS7Sf2_KFgQPnoZhnnmZeQC4RnCGEJTz9XI9wxCymeAYVuQETBBjVSk5o6dgAiESpaRUnIOLlDa5pQzhCeBvVsciDc55421n9kVwRdRdE7aFCY3vPgsXYtF_h6KxyUS_633o0iU4c7pN9upYp-Dj-Wm9eC1X7y_LxeOqNETgvuQV5BWhNTGOIcGEIXWDkamxzhdyLClvhGRQCy0byiCpa6qdlggbyGsMOZmC-zF3F8PXYFOvtj4Z27a6s2FICgtIKRIygw__gohXCJNshGT09g-6CUPs8hsKSSYRJfyQNx8hE0NK0Tq1i36r414hqA6-VfatDr7V6Dtv3B1jdTK6dVmi8el3raKUcYwzdzNy3lr7O2YCCojJDy2UhcQ</recordid><startdate>20060201</startdate><enddate>20060201</enddate><creator>Lastras-Montano, L.A.</creator><creator>Castelli, V.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</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>20060201</creationdate><title>Near sufficiency of random coding for two descriptions</title><author>Lastras-Montano, L.A. ; Castelli, V.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c382t-6706734b3cf51858c3bd21cb2a07362946d8950a8a9d4503bb4afa912c06b2063</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Blocking</topic><topic>Codes</topic><topic>Coding</topic><topic>Coding, codes</topic><topic>Communication channels</topic><topic>Communication systems</topic><topic>Construction</topic><topic>Converses</topic><topic>Data compression</topic><topic>Descriptions</topic><topic>Distortion</topic><topic>Distortion measurement</topic><topic>Distribution</topic><topic>dithering</topic><topic>Entropy</topic><topic>Exact sciences and technology</topic><topic>Explosions</topic><topic>Gaps</topic><topic>H infinity control</topic><topic>Infinity</topic><topic>Information, signal and communications theory</topic><topic>lossy coding</topic><topic>Lower bounds</topic><topic>multiple descriptions (MD)</topic><topic>Mutual information</topic><topic>random coding</topic><topic>Rate distortion theory</topic><topic>rate loss</topic><topic>Rate-distortion</topic><topic>Signal and communications theory</topic><topic>Source coding</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Transmission and modulation (techniques and equipments)</topic><topic>two descriptions</topic><topic>universal bounds</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lastras-Montano, L.A.</creatorcontrib><creatorcontrib>Castelli, V.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</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>Lastras-Montano, L.A.</au><au>Castelli, V.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Near sufficiency of random coding for two descriptions</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2006-02-01</date><risdate>2006</risdate><volume>52</volume><issue>2</issue><spage>681</spage><epage>695</epage><pages>681-695</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>We give a single-letter outer bound for the two-descriptions problem for independent and identically distributed (i.i.d.) sources that is universally close to the El Gamal and Cover (EGC) inner bound. The gaps for the sum and individual rates using a quadratic distortion measure are upper-bounded by 1.5 and 0.5 bits/sample, respectively, and are universal with respect to the source being encoded and the desired distortion levels. Variants of our basic ideas are presented, including upper and lower bounds on the second channel's rate when the first channel's rate is arbitrarily close to the rate-distortion function; these bounds differ, in the limit as the code block length goes to infinity, by not more than 2 bits/sample. An interesting aspect of our methodology is the manner in which the matching single-letter outer bound is obtained, as we eschew common techniques for constructing single-letter bounds in favor of new ideas in the field of rate loss bounds. We expect these techniques to be generally applicable to other settings of interest.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TIT.2005.862073</doi><tpages>15</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2006-02, Vol.52 (2), p.681-695 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TIT_2005_862073 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Blocking Codes Coding Coding, codes Communication channels Communication systems Construction Converses Data compression Descriptions Distortion Distortion measurement Distribution dithering Entropy Exact sciences and technology Explosions Gaps H infinity control Infinity Information, signal and communications theory lossy coding Lower bounds multiple descriptions (MD) Mutual information random coding Rate distortion theory rate loss Rate-distortion Signal and communications theory Source coding Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) two descriptions universal bounds |
| title | Near sufficiency of random coding for two descriptions |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T11%3A56%3A55IST&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=Near%20sufficiency%20of%20random%20coding%20for%20two%20descriptions&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Lastras-Montano,%20L.A.&rft.date=2006-02-01&rft.volume=52&rft.issue=2&rft.spage=681&rft.epage=695&rft.pages=681-695&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2005.862073&rft_dat=%3Cproquest_RIE%3E983900621%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=195914369&rft_id=info:pmid/&rft_ieee_id=1580802&rfr_iscdi=true |