Generalized coset codes for distributed binning
In many multiterminal communication problems, constructions of good source codes involve finding distributed partitions (into bins) of a collection of quantizers associated with a group of source encoders. Further, computationally efficient procedures to index these bins are also required. In this w...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2005-10, Vol.51 (10), p.3457-3474 |
|---|---|
| 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 | 3474 |
|---|---|
| container_issue | 10 |
| container_start_page | 3457 |
| container_title | IEEE transactions on information theory |
| container_volume | 51 |
| creator | Pradhan, S.S. Ramchandran, K. |
| description | In many multiterminal communication problems, constructions of good source codes involve finding distributed partitions (into bins) of a collection of quantizers associated with a group of source encoders. Further, computationally efficient procedures to index these bins are also required. In this work, we consider a constructive approach for distributed binning in an algebraic framework. Several application scenarios fall under the scope of this paper including the CEO problem, distributed source coding, and n-channel symmetric multiple description source coding with n>2. Specifically, in this exposition we consider the case of two codebooks while focusing on the Gaussian CEO problem with mean squared error reconstruction and with two symmetric observations. This problem deals with distributed encoding of correlated noisy observations of a source into descriptions such that the joint decoder having access to them can reconstruct the source with a fidelity criterion. We employ generalized coset codes constructed in a group-theoretic setting for this approach, and analyze the performance in terms of distance properties and decoding algorithms. |
| doi_str_mv | 10.1109/TIT.2005.855584 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_28019718</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1512420</ieee_id><sourcerecordid>28019718</sourcerecordid><originalsourceid>FETCH-LOGICAL-c381t-9773635fd753d8e09de93f477f5c2fa864495078c54d208ae7b4bb54b1438a793</originalsourceid><addsrcrecordid>eNp9kUFLAzEQhYMoWKtnD16KoJ62TTaTTXKUorVQ8FLPIZtNJGW7W5Pdg_56s2yh4MHLDMN878G8QeiW4DkhWC626-08x5jNBWNMwBmaEMZ4JgsG52iCMRGZBBCX6CrGXRqBkXyCFivb2KBr_2OrmWmj7VKtbJy5NswqH7vgy75Lu9I3jW8-r9GF03W0N8c-RR-vL9vlW7Z5X62Xz5vMUEG6THJOC8pcxRmthMWyspI64NwxkzstCgDJMBeGQZVjoS0voSwZlASo0FzSKXoafQ-h_ept7NTeR2PrWje27aOSBArIC4ET-fgvmQtMJCcigfd_wF3bhyZdoYhkEmMKA7QYIRPaGIN16hD8XodvRbAaclYpZzXkrMack-LhaKuj0bULujE-nmScUEmL4aK7kfPW2tM6fQFyTH8B3OWDXA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195900348</pqid></control><display><type>article</type><title>Generalized coset codes for distributed binning</title><source>IEEE Electronic Library (IEL)</source><creator>Pradhan, S.S. ; Ramchandran, K.</creator><creatorcontrib>Pradhan, S.S. ; Ramchandran, K.</creatorcontrib><description>In many multiterminal communication problems, constructions of good source codes involve finding distributed partitions (into bins) of a collection of quantizers associated with a group of source encoders. Further, computationally efficient procedures to index these bins are also required. In this work, we consider a constructive approach for distributed binning in an algebraic framework. Several application scenarios fall under the scope of this paper including the CEO problem, distributed source coding, and n-channel symmetric multiple description source coding with n>2. Specifically, in this exposition we consider the case of two codebooks while focusing on the Gaussian CEO problem with mean squared error reconstruction and with two symmetric observations. This problem deals with distributed encoding of correlated noisy observations of a source into descriptions such that the joint decoder having access to them can reconstruct the source with a fidelity criterion. We employ generalized coset codes constructed in a group-theoretic setting for this approach, and analyze the performance in terms of distance properties and decoding algorithms.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2005.855584</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algebra ; Algorithm design and analysis ; Algorithms ; Applied sciences ; Bins ; CEO problem ; Coding ; Coding, codes ; Communication networks ; Communications systems ; Computer programming ; Construction ; Decoding ; Distributed source coding ; Encoding ; Exact sciences and technology ; Focusing ; Information resources ; Information theory ; Information, signal and communications theory ; Instruments ; multiple description source coding ; Performance analysis ; Quantization ; random binning ; Reconstruction ; Sensor phenomena and characterization ; Signal and communications theory ; Source code ; Source coding ; Telecommunications and information theory ; trellis cosets</subject><ispartof>IEEE transactions on information theory, 2005-10, Vol.51 (10), p.3457-3474</ispartof><rights>2005 INIST-CNRS</rights><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2005</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c381t-9773635fd753d8e09de93f477f5c2fa864495078c54d208ae7b4bb54b1438a793</citedby><cites>FETCH-LOGICAL-c381t-9773635fd753d8e09de93f477f5c2fa864495078c54d208ae7b4bb54b1438a793</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1512420$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1512420$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17139369$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Pradhan, S.S.</creatorcontrib><creatorcontrib>Ramchandran, K.</creatorcontrib><title>Generalized coset codes for distributed binning</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>In many multiterminal communication problems, constructions of good source codes involve finding distributed partitions (into bins) of a collection of quantizers associated with a group of source encoders. Further, computationally efficient procedures to index these bins are also required. In this work, we consider a constructive approach for distributed binning in an algebraic framework. Several application scenarios fall under the scope of this paper including the CEO problem, distributed source coding, and n-channel symmetric multiple description source coding with n>2. Specifically, in this exposition we consider the case of two codebooks while focusing on the Gaussian CEO problem with mean squared error reconstruction and with two symmetric observations. This problem deals with distributed encoding of correlated noisy observations of a source into descriptions such that the joint decoder having access to them can reconstruct the source with a fidelity criterion. We employ generalized coset codes constructed in a group-theoretic setting for this approach, and analyze the performance in terms of distance properties and decoding algorithms.</description><subject>Algebra</subject><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Bins</subject><subject>CEO problem</subject><subject>Coding</subject><subject>Coding, codes</subject><subject>Communication networks</subject><subject>Communications systems</subject><subject>Computer programming</subject><subject>Construction</subject><subject>Decoding</subject><subject>Distributed source coding</subject><subject>Encoding</subject><subject>Exact sciences and technology</subject><subject>Focusing</subject><subject>Information resources</subject><subject>Information theory</subject><subject>Information, signal and communications theory</subject><subject>Instruments</subject><subject>multiple description source coding</subject><subject>Performance analysis</subject><subject>Quantization</subject><subject>random binning</subject><subject>Reconstruction</subject><subject>Sensor phenomena and characterization</subject><subject>Signal and communications theory</subject><subject>Source code</subject><subject>Source coding</subject><subject>Telecommunications and information theory</subject><subject>trellis cosets</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kUFLAzEQhYMoWKtnD16KoJ62TTaTTXKUorVQ8FLPIZtNJGW7W5Pdg_56s2yh4MHLDMN878G8QeiW4DkhWC626-08x5jNBWNMwBmaEMZ4JgsG52iCMRGZBBCX6CrGXRqBkXyCFivb2KBr_2OrmWmj7VKtbJy5NswqH7vgy75Lu9I3jW8-r9GF03W0N8c-RR-vL9vlW7Z5X62Xz5vMUEG6THJOC8pcxRmthMWyspI64NwxkzstCgDJMBeGQZVjoS0voSwZlASo0FzSKXoafQ-h_ept7NTeR2PrWje27aOSBArIC4ET-fgvmQtMJCcigfd_wF3bhyZdoYhkEmMKA7QYIRPaGIN16hD8XodvRbAaclYpZzXkrMack-LhaKuj0bULujE-nmScUEmL4aK7kfPW2tM6fQFyTH8B3OWDXA</recordid><startdate>20051001</startdate><enddate>20051001</enddate><creator>Pradhan, S.S.</creator><creator>Ramchandran, K.</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>20051001</creationdate><title>Generalized coset codes for distributed binning</title><author>Pradhan, S.S. ; Ramchandran, K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c381t-9773635fd753d8e09de93f477f5c2fa864495078c54d208ae7b4bb54b1438a793</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algebra</topic><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Bins</topic><topic>CEO problem</topic><topic>Coding</topic><topic>Coding, codes</topic><topic>Communication networks</topic><topic>Communications systems</topic><topic>Computer programming</topic><topic>Construction</topic><topic>Decoding</topic><topic>Distributed source coding</topic><topic>Encoding</topic><topic>Exact sciences and technology</topic><topic>Focusing</topic><topic>Information resources</topic><topic>Information theory</topic><topic>Information, signal and communications theory</topic><topic>Instruments</topic><topic>multiple description source coding</topic><topic>Performance analysis</topic><topic>Quantization</topic><topic>random binning</topic><topic>Reconstruction</topic><topic>Sensor phenomena and characterization</topic><topic>Signal and communications theory</topic><topic>Source code</topic><topic>Source coding</topic><topic>Telecommunications and information theory</topic><topic>trellis cosets</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Pradhan, S.S.</creatorcontrib><creatorcontrib>Ramchandran, K.</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>Pradhan, S.S.</au><au>Ramchandran, K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Generalized coset codes for distributed binning</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2005-10-01</date><risdate>2005</risdate><volume>51</volume><issue>10</issue><spage>3457</spage><epage>3474</epage><pages>3457-3474</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>In many multiterminal communication problems, constructions of good source codes involve finding distributed partitions (into bins) of a collection of quantizers associated with a group of source encoders. Further, computationally efficient procedures to index these bins are also required. In this work, we consider a constructive approach for distributed binning in an algebraic framework. Several application scenarios fall under the scope of this paper including the CEO problem, distributed source coding, and n-channel symmetric multiple description source coding with n>2. Specifically, in this exposition we consider the case of two codebooks while focusing on the Gaussian CEO problem with mean squared error reconstruction and with two symmetric observations. This problem deals with distributed encoding of correlated noisy observations of a source into descriptions such that the joint decoder having access to them can reconstruct the source with a fidelity criterion. We employ generalized coset codes constructed in a group-theoretic setting for this approach, and analyze the performance in terms of distance properties and decoding algorithms.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TIT.2005.855584</doi><tpages>18</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2005-10, Vol.51 (10), p.3457-3474 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28019718 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algebra Algorithm design and analysis Algorithms Applied sciences Bins CEO problem Coding Coding, codes Communication networks Communications systems Computer programming Construction Decoding Distributed source coding Encoding Exact sciences and technology Focusing Information resources Information theory Information, signal and communications theory Instruments multiple description source coding Performance analysis Quantization random binning Reconstruction Sensor phenomena and characterization Signal and communications theory Source code Source coding Telecommunications and information theory trellis cosets |
| title | Generalized coset codes for distributed binning |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T12%3A46%3A14IST&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=Generalized%20coset%20codes%20for%20distributed%20binning&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Pradhan,%20S.S.&rft.date=2005-10-01&rft.volume=51&rft.issue=10&rft.spage=3457&rft.epage=3474&rft.pages=3457-3474&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2005.855584&rft_dat=%3Cproquest_RIE%3E28019718%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=195900348&rft_id=info:pmid/&rft_ieee_id=1512420&rfr_iscdi=true |