{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/13395"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/13395","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"On the Sum Rate of Multiple Description Coding with Symmetric Distortion Constraints","abstract":"<p>We derive a single-letter lower bound on the minimum sum rate of multiple description coding with symmetric distortion constraints. For the binary uniform source with the erasure distortion measure or the Hamming distortion measure, this lower bound can be evaluated with the aid of certain minimax theorems. A similar minimax theorem is established in the quadratic Gaussian setting, which is further leveraged to analyze the special case where the minimum sum rate subject to two levels of distortion constraints (with the second level imposed on the complete set of descriptions) is attained; in particular, we determine the minimum achievable distortions at the intermediate levels.</p> <p>Key Words: Erasure distortion, Hamming distortion, mean squared error, minimax theorem, multiple description coding, saddle point.</p>","abstract_html":"&lt;p&gt;We derive a single-letter lower bound on the minimum sum rate of multiple description coding with symmetric distortion constraints. For the binary uniform source with the erasure distortion measure or the Hamming distortion measure, this lower bound can be evaluated with the aid of certain minimax theorems. A similar minimax theorem is established in the quadratic Gaussian setting, which is further leveraged to analyze the special case where the minimum sum rate subject to two levels of distortion constraints (with the second level imposed on the complete set of descriptions) is attained; in particular, we determine the minimum achievable distortions at the intermediate levels.&lt;/p&gt; &lt;p&gt;Key Words: Erasure distortion, Hamming distortion, mean squared error, minimax theorem, multiple description coding, saddle point.&lt;/p&gt;","abstract_has_math":false,"creators":["Shao, Shuo"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Electrical and Computer Engineering","school":null,"contributors":[],"advisors":["Chen, Jun"],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-10","date_published":"2013-10","updated_at":"2026-11-18T19:36:25Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/16528"],"render_values":[{"text":"https://doi.org/10.71548/16528","href":"https://doi.org/10.71548/16528","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/8215","9214","4556776"],"render_values":[{"text":"opendissertations/8215","href":null,"code":true},{"text":"9214","href":null,"code":true},{"text":"4556776","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/13395","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/13395","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F13395","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Chen, Jun"]},{"key":"dc:contributor.department","label":"Department","values":["Electrical and Computer Engineering"]},{"key":"dc:creator","label":"Author","values":["Shao, Shuo"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T17:03:47Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T17:03:47Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2013-09-05"]},{"key":"dc:date.issued","label":"Date","values":["2013-10"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/8215","9214","4556776"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/13395","https://doi.org/10.71548/16528"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>We derive a single-letter lower bound on the minimum sum rate of multiple description coding with symmetric distortion constraints. For the binary uniform source with the erasure distortion measure or the Hamming distortion measure, this lower bound can be evaluated with the aid of certain minimax theorems. A similar minimax theorem is established in the quadratic Gaussian setting, which is further leveraged to analyze the special case where the minimum sum rate subject to two levels of distortion constraints (with the second level imposed on the complete set of descriptions) is attained; in particular, we determine the minimum achievable distortions at the intermediate levels.</p> <p>Key Words: Erasure distortion, Hamming distortion, mean squared error, minimax theorem, multiple description coding, saddle point.</p>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Applied Science (MASc)"]},{"key":"dc:title","label":"Title","values":["On the Sum Rate of Multiple Description Coding with Symmetric Distortion Constraints"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Chen, Jun"],"dc:contributor.department":["Electrical and Computer Engineering"],"dc:creator":["Shao, Shuo"],"dc:date.accessioned":["2014-06-18T17:03:47Z"],"dc:date.available":["2014-06-18T17:03:47Z"],"dc:date.created":["2013-09-05"],"dc:date.issued":["2013-10"],"dc:description.abstract":["<p>We derive a single-letter lower bound on the minimum sum rate of multiple description coding with symmetric distortion constraints. For the binary uniform source with the erasure distortion measure or the Hamming distortion measure, this lower bound can be evaluated with the aid of certain minimax theorems. A similar minimax theorem is established in the quadratic Gaussian setting, which is further leveraged to analyze the special case where the minimum sum rate subject to two levels of distortion constraints (with the second level imposed on the complete set of descriptions) is attained; in particular, we determine the minimum achievable distortions at the intermediate levels.</p> <p>Key Words: Erasure distortion, Hamming distortion, mean squared error, minimax theorem, multiple description coding, saddle point.</p>"],"dc:description.degree":["Master of Applied Science (MASc)"],"dc:identifier.other":["opendissertations/8215","9214","4556776"],"dc:identifier.uri":["http://hdl.handle.net/11375/13395","https://doi.org/10.71548/16528"],"dc:title":["On the Sum Rate of Multiple Description Coding with Symmetric Distortion Constraints"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:36:25Z"}