{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/13293"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/13293","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Polar Codes for Multiple Descriptions","abstract":"<p>Two coding schemes based on polar codes are proposed for the multiple description (MD) problem. The first scheme is an adaptation of the one developed by \\c{S}a\\c{s}o\\u{g}lu {\\em et al.} for the multiple access channel to the MD setting. Specifically, it is shown that the scheme is able to achieve certain rate pairs on the dominant line of the achievable rate region determined by El Gamal and Cover (EGC) when the associated auxiliary random variables have different prime alphabet sizes. Different from polar coding for the multiple access channel considered by \\c{S}a\\c{s}o\\u{g}lu {\\em et al.}, the auxiliary random variables in the MD problem can be dependent, and their alphabet sizes play an unexpected important role in the construction. The second scheme is based on the idea of rate splitting. We show that it can achieve the entire EGC rate region. The effectiveness of the proposed polar coding schemes is verified by the experimental results.</p>","abstract_html":"&lt;p&gt;Two coding schemes based on polar codes are proposed for the multiple description (MD) problem. The first scheme is an adaptation of the one developed by \\c{S}a\\c{s}o\\u{g}lu {\\em et al.} for the multiple access channel to the MD setting. Specifically, it is shown that the scheme is able to achieve certain rate pairs on the dominant line of the achievable rate region determined by El Gamal and Cover (EGC) when the associated auxiliary random variables have different prime alphabet sizes. Different from polar coding for the multiple access channel considered by \\c{S}a\\c{s}o\\u{g}lu {\\em et al.}, the auxiliary random variables in the MD problem can be dependent, and their alphabet sizes play an unexpected important role in the construction. The second scheme is based on the idea of rate splitting. We show that it can achieve the entire EGC rate region. The effectiveness of the proposed polar coding schemes is verified by the experimental results.&lt;/p&gt;","abstract_has_math":false,"creators":["Shi, Qi"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Electrical and Computer Engineering","school":null,"contributors":[],"advisors":["Chen, Jun","D. Zhao and S. Dumitrescu"],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-10","date_published":"2013-10","updated_at":"2026-11-18T19:39:05Z","subjects":["polar codes multiple description rate splitting","Electrical and Computer Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/22757"],"render_values":[{"text":"https://doi.org/10.71548/22757","href":"https://doi.org/10.71548/22757","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/8112","9203","4551140"],"render_values":[{"text":"opendissertations/8112","href":null,"code":true},{"text":"9203","href":null,"code":true},{"text":"4551140","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/13293","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/13293","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%2F13293","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Chen, Jun","D. Zhao and S. Dumitrescu"]},{"key":"dc:contributor.department","label":"Department","values":["Electrical and Computer Engineering"]},{"key":"dc:creator","label":"Author","values":["Shi, Qi"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T17:03:34Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T17:03:34Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2013-09-04"]},{"key":"dc:date.issued","label":"Date","values":["2013-10"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["polar codes multiple description rate splitting","Electrical and Computer Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/8112","9203","4551140"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/13293","https://doi.org/10.71548/22757"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>Two coding schemes based on polar codes are proposed for the multiple description (MD) problem. The first scheme is an adaptation of the one developed by \\c{S}a\\c{s}o\\u{g}lu {\\em et al.} for the multiple access channel to the MD setting. Specifically, it is shown that the scheme is able to achieve certain rate pairs on the dominant line of the achievable rate region determined by El Gamal and Cover (EGC) when the associated auxiliary random variables have different prime alphabet sizes. Different from polar coding for the multiple access channel considered by \\c{S}a\\c{s}o\\u{g}lu {\\em et al.}, the auxiliary random variables in the MD problem can be dependent, and their alphabet sizes play an unexpected important role in the construction. The second scheme is based on the idea of rate splitting. We show that it can achieve the entire EGC rate region. The effectiveness of the proposed polar coding schemes is verified by the experimental results.</p>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Applied Science (MASc)"]},{"key":"dc:title","label":"Title","values":["Polar Codes for Multiple Descriptions"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Chen, Jun","D. Zhao and S. Dumitrescu"],"dc:contributor.department":["Electrical and Computer Engineering"],"dc:creator":["Shi, Qi"],"dc:date.accessioned":["2014-06-18T17:03:34Z"],"dc:date.available":["2014-06-18T17:03:34Z"],"dc:date.created":["2013-09-04"],"dc:date.issued":["2013-10"],"dc:description.abstract":["<p>Two coding schemes based on polar codes are proposed for the multiple description (MD) problem. The first scheme is an adaptation of the one developed by \\c{S}a\\c{s}o\\u{g}lu {\\em et al.} for the multiple access channel to the MD setting. Specifically, it is shown that the scheme is able to achieve certain rate pairs on the dominant line of the achievable rate region determined by El Gamal and Cover (EGC) when the associated auxiliary random variables have different prime alphabet sizes. Different from polar coding for the multiple access channel considered by \\c{S}a\\c{s}o\\u{g}lu {\\em et al.}, the auxiliary random variables in the MD problem can be dependent, and their alphabet sizes play an unexpected important role in the construction. The second scheme is based on the idea of rate splitting. We show that it can achieve the entire EGC rate region. The effectiveness of the proposed polar coding schemes is verified by the experimental results.</p>"],"dc:description.degree":["Master of Applied Science (MASc)"],"dc:identifier.other":["opendissertations/8112","9203","4551140"],"dc:identifier.uri":["http://hdl.handle.net/11375/13293","https://doi.org/10.71548/22757"],"dc:subject":["polar codes multiple description rate splitting","Electrical and Computer Engineering"],"dc:title":["Polar Codes for Multiple Descriptions"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:39:05Z"}