{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/80947"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/80947","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Unified Structural View of Multiterminal Source Coding","abstract":"In fact, we set distributed source coding problems in a general framework and take a unified structural view of not only the above open problems but any two-terminal problem with noncooperative encoding. The distortion criteria, if applicable, are required to apply to single letters and be bounded. The key to the above unification is held by a fundamental source coding principle which dissociates the underlying source coding mechanism from the applicable distortion criteria and extends the typicality arguments of Shannon and Wyner-Ziv. We generalize our theory further to show that distortion criteria can also be dissociated from the underlying coding mechanism in an arbitrary multiterminal setup. As in the two-terminal problem, the general achievable region permits an infinite order information-theoretic description. Moreover, we validate our analysis by rederiving known coding theorems using our technique: Our infinite order descriptions are shown to simplify to the expected first order in the known cases.","abstract_html":"In fact, we set distributed source coding problems in a general framework and take a unified structural view of not only the above open problems but any two-terminal problem with noncooperative encoding. The distortion criteria, if applicable, are required to apply to single letters and be bounded. The key to the above unification is held by a fundamental source coding principle which dissociates the underlying source coding mechanism from the applicable distortion criteria and extends the typicality arguments of Shannon and Wyner-Ziv. We generalize our theory further to show that distortion criteria can also be dissociated from the underlying coding mechanism in an arbitrary multiterminal setup. As in the two-terminal problem, the general achievable region permits an infinite order information-theoretic description. Moreover, we validate our analysis by rederiving known coding theorems using our technique: Our infinite order descriptions are shown to simplify to the expected first order in the known cases.","abstract_has_math":false,"creators":["Jana, Soumya"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical Engineering","degree_department":null,"school":null,"contributors":["Blahut, Richard E."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:08:57Z","date_published":"2015-09-25T20:08:57Z","updated_at":"2026-07-22T22:26:15Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3202108"],"render_values":[{"text":"(MiAaPQ)AAI3202108","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/80947","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Blahut, Richard E."]},{"key":"dc:creator","label":"Author","values":["Jana, Soumya"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:08:57Z","10000-01-01","2005"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/80947","(MiAaPQ)AAI3202108"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In fact, we set distributed source coding problems in a general framework and take a unified structural view of not only the above open problems but any two-terminal problem with noncooperative encoding. The distortion criteria, if applicable, are required to apply to single letters and be bounded. The key to the above unification is held by a fundamental source coding principle which dissociates the underlying source coding mechanism from the applicable distortion criteria and extends the typicality arguments of Shannon and Wyner-Ziv. We generalize our theory further to show that distortion criteria can also be dissociated from the underlying coding mechanism in an arbitrary multiterminal setup. As in the two-terminal problem, the general achievable region permits an infinite order information-theoretic description. Moreover, we validate our analysis by rederiving known coding theorems using our technique: Our infinite order descriptions are shown to simplify to the expected first order in the known cases.","Made available in DSpace on 2015-09-25T20:08:57Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3202108.pdf: 2672464 bytes, checksum: 4ea9f4f42383343dd1d4c50e650f9b25 (MD5) Previous issue date: 2005","Embargo set by: Seth Robbins for item 82229 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","113 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005."]},{"key":"dc:title","label":"Title","values":["Unified Structural View of Multiterminal Source Coding"]}]}],"canonical_facts":{"dc:contributor":["Blahut, Richard E."],"dc:creator":["Jana, Soumya"],"dc:date":["2015-09-25T20:08:57Z","10000-01-01","2005"],"dc:description":["In fact, we set distributed source coding problems in a general framework and take a unified structural view of not only the above open problems but any two-terminal problem with noncooperative encoding. The distortion criteria, if applicable, are required to apply to single letters and be bounded. The key to the above unification is held by a fundamental source coding principle which dissociates the underlying source coding mechanism from the applicable distortion criteria and extends the typicality arguments of Shannon and Wyner-Ziv. We generalize our theory further to show that distortion criteria can also be dissociated from the underlying coding mechanism in an arbitrary multiterminal setup. As in the two-terminal problem, the general achievable region permits an infinite order information-theoretic description. Moreover, we validate our analysis by rederiving known coding theorems using our technique: Our infinite order descriptions are shown to simplify to the expected first order in the known cases.","Made available in DSpace on 2015-09-25T20:08:57Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3202108.pdf: 2672464 bytes, checksum: 4ea9f4f42383343dd1d4c50e650f9b25 (MD5) Previous issue date: 2005","Embargo set by: Seth Robbins for item 82229 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","113 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005."],"dc:identifier":["http://hdl.handle.net/2142/80947","(MiAaPQ)AAI3202108"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Unified Structural View of Multiterminal Source Coding"],"dc:type":["text"],"thesis:degree_discipline":["Electrical Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:15Z"}