{"id":"https://openalex.org/W3198594110","doi":"https://doi.org/10.1109/isit45174.2021.9518007","title":"Polar Shaping Codes for Costly Noiseless and Noisy Channels","display_name":"Polar Shaping Codes for Costly Noiseless and Noisy Channels","publication_year":2021,"publication_date":"2021-07-12","ids":{"openalex":"https://openalex.org/W3198594110","doi":"https://doi.org/10.1109/isit45174.2021.9518007","mag":"3198594110"},"language":"en","primary_location":{"id":"doi:10.1109/isit45174.2021.9518007","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9518007","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046374915","display_name":"Karthik Nagarjuna Tunuguntla","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Karthik Nagarjuna Tunuguntla","raw_affiliation_strings":["University of California,CMRR,San Diego","CMRR, University of California, San Diego"],"affiliations":[{"raw_affiliation_string":"University of California,CMRR,San Diego","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"CMRR, University of California, San Diego","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060049531","display_name":"Paul H. Siegel","orcid":"https://orcid.org/0000-0001-5850-0874"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul H. Siegel","raw_affiliation_strings":["University of California,CMRR,San Diego","CMRR, University of California, San Diego"],"affiliations":[{"raw_affiliation_string":"University of California,CMRR,San Diego","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"CMRR, University of California, San Diego","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046374915"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":0.1591,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52732303,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"2560","last_page":"2565"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7683297395706177},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.6697935461997986},{"id":"https://openalex.org/keywords/polar","display_name":"Polar","score":0.6269986629486084},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.6220327615737915},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6039229035377502},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.597548246383667},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5496450662612915},{"id":"https://openalex.org/keywords/polar-code","display_name":"Polar code","score":0.5437655448913574},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.521607518196106},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.5205436944961548},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.42278391122817993},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3677242696285248},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.35552728176116943},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.345390260219574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3060656785964966},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.27596354484558105},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.20437195897102356},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17088088393211365}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7683297395706177},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.6697935461997986},{"id":"https://openalex.org/C29705727","wikidata":"https://www.wikidata.org/wiki/Q294562","display_name":"Polar","level":2,"score":0.6269986629486084},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.6220327615737915},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6039229035377502},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.597548246383667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5496450662612915},{"id":"https://openalex.org/C2778396592","wikidata":"https://www.wikidata.org/wiki/Q7209069","display_name":"Polar code","level":3,"score":0.5437655448913574},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.521607518196106},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.5205436944961548},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.42278391122817993},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3677242696285248},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.35552728176116943},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.345390260219574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3060656785964966},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.27596354484558105},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.20437195897102356},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17088088393211365},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit45174.2021.9518007","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9518007","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W627952176","https://openalex.org/W1011723640","https://openalex.org/W1599295008","https://openalex.org/W1890869813","https://openalex.org/W1995875735","https://openalex.org/W2096894382","https://openalex.org/W2150498905","https://openalex.org/W2175334662","https://openalex.org/W2295517275","https://openalex.org/W2338291070","https://openalex.org/W2505777393","https://openalex.org/W2752137666","https://openalex.org/W2910519866","https://openalex.org/W2916508064","https://openalex.org/W3016023473","https://openalex.org/W3081373082","https://openalex.org/W3198594110"],"related_works":["https://openalex.org/W2372190485","https://openalex.org/W2139769859","https://openalex.org/W2583282232","https://openalex.org/W2962908977","https://openalex.org/W2137028263","https://openalex.org/W2810502498","https://openalex.org/W2744779861","https://openalex.org/W2130518071","https://openalex.org/W2951344115","https://openalex.org/W1972831370"],"abstract_inverted_index":{"We":[0,35,46,91],"propose":[1,107],"a":[2,10,60,67,78,87],"shaping":[3,24,38,109],"code":[4,25],"based":[5],"on":[6,52,81],"polar":[7,23,108,122],"codes.":[8],"For":[9],"costly":[11,40,88,98,112],"noiseless":[12],"channel,":[13],"we":[14,70,106],"show":[15],"that":[16,55,115],"the":[17,21,27,53,82,93,97,117],"total":[18,29,84],"cost":[19,30,85],"of":[20],"proposed":[22,127],"approaches":[26],"optimal":[28,83],"as":[31],"block":[32],"length":[33],"grows.":[34],"also":[36],"consider":[37],"for":[39,86,96,111,124],"noisy":[41,89,113],"discrete":[42],"memoryless":[43],"channels":[44,114,126],"(DMCs).":[45],"first":[47],"give":[48],"an":[49,72],"upper":[50],"bound":[51,80,95,119],"rate":[54],"can":[56],"be":[57],"achieved":[58],"with":[59],"specified":[61],"symbol":[62],"occurrence":[63],"probability":[64],"distribution":[65],"over":[66],"DMC.":[68,90],"Then":[69],"formulate":[71],"optimization":[73],"problem":[74],"whose":[75],"solution":[76],"gives":[77],"lower":[79,94,118],"compute":[92],"<tex":[99],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[100],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$M$</tex>":[101],"-ary":[102],"erasure":[103],"channel.":[104],"Finally,":[105],"codes":[110,123],"achieve":[116],"by":[120,128],"adapting":[121],"asymmetric":[125],"Honda":[129],"and":[130],"Yamamoto.":[131]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}