{"id":"https://openalex.org/W6948382396","doi":"https://doi.org/10.5075/epfl-thesis-8989","title":"Symmetry in design and decoding of polar-like codes","display_name":"Symmetry in design and decoding of polar-like codes","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W6948382396","doi":"https://doi.org/10.5075/epfl-thesis-8989"},"language":"en","primary_location":{"id":"pmh:oai:infoscience.epfl.ch:292182","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/185606","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoral thesis"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/handle/20.500.14299/185606","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ivanov, Kirill","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ivanov, Kirill","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9442999958992004,"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.9442999958992004,"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/T11797","display_name":"graph theory and CDMA systems","score":0.012600000016391277,"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/T11130","display_name":"Coding theory and cryptography","score":0.01119999960064888,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.760200023651123},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.5432000160217285},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4512999951839447},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4090999960899353},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.40220001339912415},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.390500009059906},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.38339999318122864},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.37400001287460327},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.33169999718666077}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.760200023651123},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.5432000160217285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5040000081062317},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4871000051498413},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4512999951839447},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4090999960899353},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.40220001339912415},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.390500009059906},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.38339999318122864},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.37400001287460327},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36489999294281006},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34950000047683716},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34630000591278076},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.33169999718666077},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.3188999891281128},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.31540000438690186},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.31450000405311584},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3059999942779541},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.3041999936103821},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.287200003862381},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.2824000120162964},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.2799000144004822},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.2766999900341034},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.2709999978542328},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.259799987077713},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:infoscience.epfl.ch:292182","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/185606","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoral thesis"},{"id":"doi:10.5075/epfl-thesis-8989","is_oa":true,"landing_page_url":"https://doi.org/10.5075/epfl-thesis-8989","pdf_url":null,"source":{"id":"https://openalex.org/S4306400488","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"thesis"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:292182","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/185606","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoral thesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,130,215,267,407],"beginning":[1],"of":[2,28,53,86,99,121,153,180,196,206,218,227,279,292,333,341,389,451],"21st":[3],"century":[4],"provided":[5],"us":[6,272],"with":[7,253],"many":[8],"answers":[9],"about":[10,91,330],"how":[11],"to":[12,43,126,201,273,308,358,363,372,403,415,430],"reach":[13],"the":[14,26,51,54,79,83,92,100,111,128,136,144,147,151,158,165,177,192,197,219,225,276,289,316,331,334,338,342,345,373,390,394,397,404,425,446],"channel":[15,68,408],"capacity.":[16],"Polarization":[17],"and":[18,56,69,123,143,170,221,314,443],"spatial":[19],"coupling":[20],"are":[21,115,124],"two":[22,107],"techniques":[23],"for":[24,66,78,110,173,187,231,258],"achieving":[25],"capacity":[27,45],"binary":[29,382],"memoryless":[30],"symmetric":[31,208],"channels":[32],"under":[33,117],"low-complexity":[34],"decoding":[35,108,166,205,230],"algorithms.":[36],"Recent":[37],"results":[38],"prove":[39,274],"that":[40,95,164,203,248,262,275,319,351,377],"another":[41,244],"way":[42],"achieve":[44],"is":[46,50,75,132,162,352,411],"via":[47],"symmetry,":[48],"which":[49,74,114,367],"case":[52],"Reed-Muller":[55,112,220],"extended":[57],"Bose-Chaudhuri-Hocquenghem":[58],"(BCH)":[59],"codes.":[60,175,385],"However,":[61,156],"this":[62,87,181,188,293,369,432],"proof":[63],"holds":[64],"only":[65],"erasure":[67],"maximum":[70],"a":[71,118,254,284,297,348,436],"posteriori":[72],"decoding,":[73,142],"computationally":[76],"intractable":[77],"general":[80],"channels.":[81],"In":[82,176,288,356,428],"first":[84,447],"part":[85,179,291,340],"thesis,":[88,182,294],"we":[89,183,235,263,295,434],"talk":[90],"performance":[93,159],"improvements":[94],"an":[96,185,212],"automorphism":[97,216,277],"group":[98,120,278],"code":[101,148,198,399],"brings":[102],"on":[103,134,239],"board.":[104],"We":[105,190,246],"propose":[106],"algorithms":[109],"codes,":[113,233],"invariant":[116],"large":[119,285],"permutations":[122,138],"expected":[125],"benefit":[127],"most.":[129],"former":[131],"based":[133],"plugging":[135],"codeword":[137],"in":[139,199,409,445],"successive":[140],"cancellation":[141],"latter":[145],"utilizes":[146],"representation":[149,195],"as":[150],"evaluations":[152],"Boolean":[154,193],"monomials.":[155],"despite":[157],"improvements,":[160],"it":[161,419],"clear":[163],"complexity":[167],"grows":[168],"quickly":[169],"becomes":[171],"impractical":[172],"moderate-length":[174],"second":[178],"provide":[184,309],"explanation":[186],"observation.":[189],"use":[191],"polynomial":[194],"order":[200,357,429],"show":[202],"polar-like":[204,229],"sufficiently":[207],"codes":[209,223,281,442],"asymptotically":[210,249],"needs":[211,362],"exponential":[213],"complexity.":[214],"groups":[217],"eBCH":[222],"limit":[224],"efficiency":[226],"their":[228],"long":[232],"hence":[234],"either":[236],"should":[237,400],"focus":[238],"short":[240],"lengths":[241],"or":[242],"find":[243],"way.":[245],"demonstrate":[247],"same":[250],"restrictions":[251],"(although":[252],"slower":[255],"convergence)":[256],"hold":[257],"more":[259],"relaxed":[260],"condition":[261],"call":[264],"partial":[265],"symmetry.":[266],"developed":[268],"framework":[269],"also":[270],"enables":[271],"polar":[280],"cannot":[282],"include":[283],"affine":[286],"subgroup.":[287],"last":[290],"address":[296],"completely":[298],"different":[299],"problem.":[300],"A":[301],"device-independent":[302],"quantum":[303,323,339],"key":[304,350,395],"distribution":[305],"(DIQKD)":[306],"aims":[307],"private":[310],"communication":[311,335],"between":[312],"parties":[313,346],"has":[315],"security":[317],"guarantees":[318],"come":[320],"mostly":[321],"from":[322,424],"physics,":[324],"without":[325],"making":[326],"potentially":[327],"unrealistic":[328],"assumptions":[329],"nature":[332],"devices.":[336],"After":[337],"DIQKD":[343,452],"protocol,":[344],"share":[347],"secret":[349],"not":[353],"perfectly":[354],"correlated.":[355],"synchronize,":[359],"some":[360],"information":[361,392],"be":[364,379],"revealed":[365,391],"publicly,":[366],"makes":[368],"formulation":[370],"equivalent":[371],"asymmetric":[374],"Slepian-Wolf":[375],"problem":[376],"can":[378,420],"solved":[380],"using":[381,439],"linear":[383],"error-correction":[384],"As":[386],"any":[387],"amount":[388],"reduces":[393],"secrecy,":[396],"utilized":[398],"operate":[401],"close":[402],"finite-length":[405],"limits.":[406],"consideration":[410],"non-standard":[412],"and,":[413],"due":[414],"its":[416],"experimental":[417,449],"nature,":[418],"actually":[421],"slightly":[422],"differ":[423],"considered":[426],"models.":[427],"solve":[431],"problem,":[433],"designed":[435],"simple":[437],"scheme":[438],"universal":[440],"SC-LDPC":[441],"used":[444],"successful":[448],"demonstration":[450],"protocol.":[453]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}