{"id":"https://openalex.org/W4415368306","doi":"https://doi.org/10.1109/isit63088.2025.11195226","title":"An Analytical Study of the Min-Sum Approximation for Polar Codes","display_name":"An Analytical Study of the Min-Sum Approximation for Polar Codes","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368306","doi":"https://doi.org/10.1109/isit63088.2025.11195226"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195226","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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/A5116014425","display_name":"Nir Chisnevski","orcid":null},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Nir Chisnevski","raw_affiliation_strings":["The Andrew and Erna Viterbi Faculty of Electrical and Computer Engineering,Haifa,Israel,32000"],"affiliations":[{"raw_affiliation_string":"The Andrew and Erna Viterbi Faculty of Electrical and Computer Engineering,Haifa,Israel,32000","institution_ids":["https://openalex.org/I91203450"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075380828","display_name":"Ido Tal","orcid":"https://orcid.org/0000-0001-5419-1162"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ido Tal","raw_affiliation_strings":["The Andrew and Erna Viterbi Faculty of Electrical and Computer Engineering,Haifa,Israel,32000"],"affiliations":[{"raw_affiliation_string":"The Andrew and Erna Viterbi Faculty of Electrical and Computer Engineering,Haifa,Israel,32000","institution_ids":["https://openalex.org/I91203450"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025989795","display_name":"Shlomo Shamai","orcid":"https://orcid.org/0000-0002-6594-3371"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shlomo Shamai Shitz","raw_affiliation_strings":["The Andrew and Erna Viterbi Faculty of Electrical and Computer Engineering,Haifa,Israel,32000"],"affiliations":[{"raw_affiliation_string":"The Andrew and Erna Viterbi Faculty of Electrical and Computer Engineering,Haifa,Israel,32000","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5116014425"],"corresponding_institution_ids":["https://openalex.org/I91203450"],"apc_list":null,"apc_paid":null,"fwci":2.26,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.9117595,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9779000282287598,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11130","display_name":"Coding theory and cryptography","score":0.9779000282287598,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9617999792098999,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.95660001039505,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/polar-code","display_name":"Polar code","score":0.7807000279426575},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.7613000273704529},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6646000146865845},{"id":"https://openalex.org/keywords/polar","display_name":"Polar","score":0.5576000213623047},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5282999873161316},{"id":"https://openalex.org/keywords/probability-of-error","display_name":"Probability of error","score":0.5009999871253967},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.44530001282691956},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.43549999594688416},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.3995000123977661}],"concepts":[{"id":"https://openalex.org/C2778396592","wikidata":"https://www.wikidata.org/wiki/Q7209069","display_name":"Polar code","level":3,"score":0.7807000279426575},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.7613000273704529},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6646000146865845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6126000285148621},{"id":"https://openalex.org/C29705727","wikidata":"https://www.wikidata.org/wiki/Q294562","display_name":"Polar","level":2,"score":0.5576000213623047},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5282999873161316},{"id":"https://openalex.org/C92224547","wikidata":"https://www.wikidata.org/wiki/Q1673216","display_name":"Probability of error","level":2,"score":0.5009999871253967},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.44530001282691956},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44510000944137573},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.43549999594688416},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.3995000123977661},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.36320000886917114},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3488999903202057},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.3264999985694885},{"id":"https://openalex.org/C205049153","wikidata":"https://www.wikidata.org/wiki/Q2698605","display_name":"Polarization (electrochemistry)","level":2,"score":0.3215000033378601},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3100000023841858},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.302700012922287},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C40969351","wikidata":"https://www.wikidata.org/wiki/Q3516228","display_name":"Word error rate","level":2,"score":0.29600000381469727},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.2870999872684479},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.2745000123977661},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195226","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6643521173","display_name":null,"funder_award_id":"CIF-2212437","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W183754908","https://openalex.org/W2084346236","https://openalex.org/W2096894382","https://openalex.org/W2106045225","https://openalex.org/W2123530431","https://openalex.org/W2150498905","https://openalex.org/W2160551021","https://openalex.org/W2162099497","https://openalex.org/W2163509114","https://openalex.org/W2164368671","https://openalex.org/W2175334662","https://openalex.org/W2211831180","https://openalex.org/W2221448779","https://openalex.org/W2258909494","https://openalex.org/W2284321898","https://openalex.org/W2898657024","https://openalex.org/W2921868595","https://openalex.org/W2943019532","https://openalex.org/W3010298929","https://openalex.org/W3037524284","https://openalex.org/W3198709941","https://openalex.org/W4250589301","https://openalex.org/W4386075172","https://openalex.org/W4401693466","https://openalex.org/W4406260526","https://openalex.org/W4415368306"],"related_works":[],"abstract_inverted_index":{"The":[0,226],"min-sum":[1,50,183,240],"approximation":[2,241],"is":[3,14,87,122,222,229,242],"widely":[4],"used":[5],"in":[6,23,78,232],"the":[7,34,49,57,60,70,88,98,102,123,126,182,193,199,223,235,239],"decoding":[8],"of":[9,37,73,125,148,203,237],"polar":[10,149],"codes.":[11],"Although":[12],"it":[13],"a":[15,27,38,93,130,146],"numerical":[16],"approximation,":[17],"hardly":[18],"any":[19,133,138],"penalties":[20],"are":[21,158,168,206],"incurred":[22],"practice.":[24],"We":[25,32,208],"give":[26],"theoretical":[28],"justification":[29],"for":[30,186],"this.":[31],"consider":[33],"common":[35],"case":[36,234],"binary-input,":[39],"memoryless,":[40],"and":[41,48,114,137,164],"symmetric":[42],"channel,":[43],"decoded":[44],"using":[45,238],"successive":[46],"cancellation":[47],"approximation.":[51,184],"Under":[52],"mild":[53],"assumptions,":[54],"we":[55,64,105,244],"show":[56,65,209],"following.":[58],"For":[59,101,132],"finite":[61],"length":[62],"case,":[63,104],"how":[66],"to":[67,179],"exactly":[68],"calculate":[69],"error":[71,166,194],"probabilities":[72,167],"all":[74],"synthetic":[75],"(bit)":[76],"channels":[77],"time":[79],"<tex":[80,84,111,115,119,134,141,161,171,190,211,219],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[81,85,112,116,120,135,142,162,172,191,212,220],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathcal{O}\\left(N^{1.585}\\right)$</tex>,":[82],"where":[83,118,218],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N$</tex>":[86],"codeword":[89],"length.":[90],"This":[91],"implies":[92],"code":[94,139,187],"construction":[95],"algorithm":[96],"with":[97,151],"above":[99],"complexity.":[100],"asymptotic":[103],"develop":[106],"two":[107],"rate":[108,140],"thresholds,":[109],"denoted":[110],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$R_{\\mathrm{L}}=R_{\\mathrm{L}}(\\lambda)$</tex>":[113],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$R_{\\mathrm{U}}=R_{\\mathrm{U}}(\\lambda)$</tex>,":[117],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\lambda(\\cdot)$</tex>":[121],"labeler":[124],"channel":[127,224],"outputs":[128],"(essentially,":[129],"quantizer).":[131],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$0&lt;\\beta&lt;\\frac{1}{2}$</tex>":[136],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$R&lt;R_{\\mathrm{L}}$</tex>,":[143],"there":[144],"exists":[145],"family":[147],"codes":[150],"growing":[152],"lengths":[153],"such":[154],"that":[155,210,243],"their":[156,165],"rates":[157,188],"at":[159,169],"least":[160],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$R$</tex>":[163],"most":[170],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$2^{-N^{\\beta}}$</tex>.":[173],"That":[174],"is,":[175],"strong":[176],"polarization":[177],"continues":[178],"hold":[180],"under":[181],"Conversely,":[185],"exceeding":[189],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$R_{\\mathrm{U}}$</tex>,":[192],"probability":[195],"approaches":[196],"1":[197],"as":[198],"code-length":[200],"increases,":[201],"irrespective":[202],"which":[204,233],"bits":[205],"frozen.":[207],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$0&lt;R_{\\mathrm{L}}":[213],"\\leq":[214,216],"R_{\\mathrm{U}}":[215],"C$</tex>,":[217],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$C$</tex>":[221],"capacity.":[225,249],"last":[227],"inequality":[228],"often":[230],"strict,":[231],"ramification":[236],"can":[245],"no":[246],"longer":[247],"achieve":[248]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-17T18:11:37.981687","created_date":"2025-10-21T00:00:00"}