{"id":"https://openalex.org/W4289655484","doi":"https://doi.org/10.1109/isit50566.2022.9834782","title":"Polar Codes Do Not Have Many Affine Automorphisms","display_name":"Polar Codes Do Not Have Many Affine Automorphisms","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655484","doi":"https://doi.org/10.1109/isit50566.2022.9834782"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834782","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834782","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/handle/20.500.14299/246747","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101961435","display_name":"Kirill Ivanov","orcid":"https://orcid.org/0000-0003-2621-7403"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Kirill Ivanov","raw_affiliation_strings":["&#x00C9;cole Polytechnique F&#x00E9;d&#x00E9;rale de Lausanne (EPFL),School of Computer and Communication Sciences,Lausanne,Switzerland,CH-1015"],"affiliations":[{"raw_affiliation_string":"&#x00C9;cole Polytechnique F&#x00E9;d&#x00E9;rale de Lausanne (EPFL),School of Computer and Communication Sciences,Lausanne,Switzerland,CH-1015","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058759310","display_name":"R\u00fcdiger Urbanke","orcid":"https://orcid.org/0000-0002-4839-821X"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"R\u00fcdiger Urbanke","raw_affiliation_strings":["&#x00C9;cole Polytechnique F&#x00E9;d&#x00E9;rale de Lausanne (EPFL),School of Computer and Communication Sciences,Lausanne,Switzerland,CH-1015"],"affiliations":[{"raw_affiliation_string":"&#x00C9;cole Polytechnique F&#x00E9;d&#x00E9;rale de Lausanne (EPFL),School of Computer and Communication Sciences,Lausanne,Switzerland,CH-1015","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101961435"],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":null,"apc_paid":null,"fwci":2.1511,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88725965,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2374","last_page":"2378"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9994999766349792,"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.9994999766349792,"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/T11130","display_name":"Coding theory and cryptography","score":0.9976000189781189,"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/T12029","display_name":"DNA and Biological Computing","score":0.9958999752998352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/automorphism","display_name":"Automorphism","score":0.7957140803337097},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.6279743909835815},{"id":"https://openalex.org/keywords/polar","display_name":"Polar","score":0.4636242389678955},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44242334365844727},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37413060665130615},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.26075127720832825},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2576912045478821},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.22942426800727844},{"id":"https://openalex.org/keywords/astronomy","display_name":"Astronomy","score":0.1165253221988678}],"concepts":[{"id":"https://openalex.org/C118712358","wikidata":"https://www.wikidata.org/wiki/Q782566","display_name":"Automorphism","level":2,"score":0.7957140803337097},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.6279743909835815},{"id":"https://openalex.org/C29705727","wikidata":"https://www.wikidata.org/wiki/Q294562","display_name":"Polar","level":2,"score":0.4636242389678955},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44242334365844727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37413060665130615},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26075127720832825},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2576912045478821},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.22942426800727844},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.1165253221988678}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit50566.2022.9834782","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834782","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:infoscience.epfl.ch:20.500.14299/246747","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/246747","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":"conference proceedings"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:20.500.14299/246747","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/246747","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":"conference proceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1940452936","https://openalex.org/W2033234285","https://openalex.org/W2150498905","https://openalex.org/W2169017678","https://openalex.org/W2264554231","https://openalex.org/W2963710189","https://openalex.org/W3008435753","https://openalex.org/W3037975779","https://openalex.org/W3102122722","https://openalex.org/W3136348518","https://openalex.org/W3155179867","https://openalex.org/W3184425224","https://openalex.org/W3197313112","https://openalex.org/W3208419198","https://openalex.org/W3214771113","https://openalex.org/W4210281993","https://openalex.org/W4221143323","https://openalex.org/W6792248313","https://openalex.org/W6792904919","https://openalex.org/W6803037007","https://openalex.org/W6803084894"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W161787318","https://openalex.org/W2998724919","https://openalex.org/W2007980826","https://openalex.org/W1997883919","https://openalex.org/W2042372008","https://openalex.org/W2376326551"],"abstract_inverted_index":{"Polar":[0],"coding":[1],"solutions":[2],"demonstrate":[3],"excellent":[4],"performance":[5],"under":[6,65],"the":[7,19,44,51,78,87,102],"list":[8],"decoding":[9,31],"that":[10,61],"is":[11,59],"challenging":[12],"to":[13,18,27],"implement":[14],"in":[15,77],"hardware":[16],"due":[17],"path":[20],"sorting":[21],"operations.":[22],"As":[23],"a":[24,34],"potential":[25],"solution":[26],"this":[28,47],"problem,":[29],"permutation":[30,81],"recently":[32],"became":[33],"hot":[35],"research":[36],"topic.":[37],"However,":[38,71],"it":[39],"imposes":[40],"more":[41],"constraints":[42],"on":[43],"code":[45],"structure.In":[46],"paper,":[48],"we":[49],"study":[50],"structural":[52],"properties":[53],"of":[54,80,89,92,104],"Arikan\u2019s":[55,93],"polar":[56,94],"codes.":[57],"It":[58],"known":[60],"they":[62],"are":[63,74],"invariant":[64],"lower-triangular":[66,105],"affine":[67,90],"permutations":[68,73],"among":[69],"others.":[70],"those":[72],"not":[75],"useful":[76],"context":[79],"decoding.":[82],"We":[83],"show":[84],"that,":[85],"unfortunately,":[86],"group":[88,103],"automorphisms":[91],"codes":[95],"asymptotically":[96],"cannot":[97],"be":[98],"much":[99],"bigger":[100],"than":[101],"permutations.":[106]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4}],"updated_date":"2026-03-27T14:29:43.386196","created_date":"2025-10-10T00:00:00"}
