{"id":"https://openalex.org/W2742871150","doi":"https://doi.org/10.1109/isit.2017.8006648","title":"Fast polarization for non-stationary channels","display_name":"Fast polarization for non-stationary channels","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2742871150","doi":"https://doi.org/10.1109/isit.2017.8006648","mag":"2742871150"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006648","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006648","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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/A5056299839","display_name":"Hessam Mahdavifar","orcid":"https://orcid.org/0000-0001-9021-1992"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hessam Mahdavifar","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056299839"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":1.8648,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.87671768,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"59","issue":null,"first_page":"849","last_page":"853"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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.9998000264167786,"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.9965000152587891,"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/T11458","display_name":"Advanced Wireless Communication Technologies","score":0.9943000078201294,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3493645191192627},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32968080043792725}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3493645191192627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32968080043792725}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2017.8006648","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006648","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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":27,"referenced_works":["https://openalex.org/W1492198494","https://openalex.org/W1999697648","https://openalex.org/W2036491047","https://openalex.org/W2055534149","https://openalex.org/W2079748983","https://openalex.org/W2121108749","https://openalex.org/W2129444266","https://openalex.org/W2150498905","https://openalex.org/W2169017678","https://openalex.org/W2169069877","https://openalex.org/W2211831180","https://openalex.org/W2234060899","https://openalex.org/W2403121992","https://openalex.org/W2491833456","https://openalex.org/W2531627753","https://openalex.org/W2547708748","https://openalex.org/W2570893422","https://openalex.org/W2576249874","https://openalex.org/W2762400891","https://openalex.org/W2963774835","https://openalex.org/W3037524284","https://openalex.org/W3098078190","https://openalex.org/W3099516920","https://openalex.org/W3102122722","https://openalex.org/W3123299285","https://openalex.org/W6729289819","https://openalex.org/W6731929577"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"We":[0,43,262],"consider":[1],"the":[2,31,46,55,91,143,146,244,247,282],"problem":[3],"of":[4,12,138,155,182,193,246,281,291],"polar":[5,50,95,127,180,284,293],"coding":[6,51,96,128],"for":[7,45,197,256],"transmission":[8,198],"overa":[9],"non-stationary":[10],"sequence":[11,154],"independent":[13],"binary-input":[14],"memoryless":[15],"symmetric":[16,57,248],"(BMS)":[17],"channels":[18,157],"{W":[19,158,200],"<sub":[20,27,39,60,67,73,81,85,159,166,201,208,216,240,252],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[21,25,28,40,61,65,68,74,78,82,86,160,164,167,202,206,209,217,222,241,253],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i</sub>":[22,41,62,87,161,203,254],"}":[23,63,162,204],"<sup":[24,64,77,163,205,221],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u221e</sup>":[26,66],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i=1</sub>":[29,69,83,168,210],"where":[30,140,171,224],"i-th":[32],"encoded":[33],"bit":[34],"is":[35,98,142,226,230,243],"transmitted":[36],"over":[37,199],"W":[38],".":[42],"show,":[44],"first":[47],"time,":[48],"a":[49,120,136,179,189,227,231,265],"scheme":[52,97],"that":[53,90,124,212,271],"achieves":[54],"average":[56,147,245],"capacity":[58],"I\u0305({W":[59],")":[70,88],"def=":[71],"lim":[72],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">N\u2192\u221e</sub>":[75],"1/N":[76],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">N</sup>":[79,165,207],"\u03a3":[80],"I(W":[84],"assuming":[89],"limit":[92],"exists.":[93],"The":[94,276],"constructed":[99,283],"using":[100],"Arikan's":[101,292],"channel":[102],"polarization":[103,112,122],"transformation":[104],"in":[105,126],"combination":[106],"with":[107,130],"certain":[108,115],"permutations":[109],"at":[110,194],"each":[111],"level":[113],"and":[114,169,185,236,238,278],"skipped":[116],"operations.":[117],"This":[118],"guarantees":[119],"fast":[121],"process":[123],"results":[125],"schemes":[129],"block":[131,190],"lengths":[132],"upper":[133,267],"bounded":[134],"by":[135],"polynomial":[137],"1/e,":[139],"e":[141],"gap":[144],"to":[145],"capacity.":[148],"More":[149],"specifically,":[150],"given":[151],"an":[152],"arbitrary":[153],"BMS":[156],"Pe,":[170],"0":[172],"<;":[173,175],"Pe":[174,196,235],"1,":[176,259],"we":[177],"construct":[178],"code":[181,285],"length":[183],"N":[184,213],"rate":[186],"R":[187],"guaranteeing":[188],"error":[191],"probability":[192],"most":[195],"such":[211],"\u2264":[214,274],"\u03ba/(I\u0305":[215],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">N</sub>":[218,242],"-":[219],"R)":[220],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u03bc</sup>":[223],"\u03bc":[225,270,273],"constant,":[228],"\u03ba":[229],"constant":[232],"depending":[233],"on":[234,269],"\u03bc,":[237],"I":[239,250],"capacities":[249],"(W":[251],"),":[255],"i":[257],"=":[258],"2,":[260],"...,N.":[261],"further":[263],"show":[264],"numerical":[266],"bound":[268],"is:":[272],"10.78.":[275],"encoding":[277],"decoding":[279],"complexities":[280],"preserves":[286],"O(N":[287],"log":[288],"N)":[289],"complexity":[290],"codes.":[294]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
