{"id":"https://openalex.org/W2976860228","doi":"https://doi.org/10.1109/isit.2019.8849628","title":"Speeding up decoding a code with a non-trivial automorphism group up to an exponential factor","display_name":"Speeding up decoding a code with a non-trivial automorphism group up to an exponential factor","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2976860228","doi":"https://doi.org/10.1109/isit.2019.8849628","mag":"2976860228"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849628","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849628","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"preprint","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/A5078763354","display_name":"Rodolfo Canto-Torres","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210132990","display_name":"State Key Laboratory of Cryptology","ror":"https://ror.org/02pn5rj08","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210132990"]}],"countries":["CN","FR"],"is_corresponding":true,"raw_author_name":"Rodolfo Canto-Torres","raw_affiliation_strings":["INRIA, Paris, 75012, France","Security, Cryptology and Transmissions"],"affiliations":[{"raw_affiliation_string":"INRIA, Paris, 75012, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Security, Cryptology and Transmissions","institution_ids":["https://openalex.org/I4210132990"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060302693","display_name":"Jean\u2013Pierre Tillich","orcid":"https://orcid.org/0000-0002-1709-1792"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210132990","display_name":"State Key Laboratory of Cryptology","ror":"https://ror.org/02pn5rj08","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210132990"]}],"countries":["CN","FR"],"is_corresponding":false,"raw_author_name":"Jean-Pierre Tillich","raw_affiliation_strings":["INRIA, Paris, 75012, France","Security, Cryptology and Transmissions"],"affiliations":[{"raw_affiliation_string":"INRIA, Paris, 75012, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Security, Cryptology and Transmissions","institution_ids":["https://openalex.org/I4210132990"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078763354"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210132990"],"apc_list":null,"apc_paid":null,"fwci":0.1446,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.58530912,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1927","last_page":"1931"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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":1.0,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9988999962806702,"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/T10849","display_name":"Finite Group Theory Research","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.8055364489555359},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5100077390670776},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.49953532218933105},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.47436246275901794},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4692060351371765},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.4620513319969177},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38153594732284546},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3649296164512634},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3578352928161621},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33861708641052246},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.11893799901008606}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8055364489555359},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5100077390670776},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.49953532218933105},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.47436246275901794},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4692060351371765},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.4620513319969177},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38153594732284546},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3649296164512634},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3578352928161621},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33861708641052246},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.11893799901008606},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2019.8849628","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849628","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02424101v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-02424101","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISIT 2019 - IEEE International Symposium on Information Theory, Jul 2019, Paris, France. pp.1927-1931, ⟨10.1109/ISIT.2019.8849628⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W23137767","https://openalex.org/W72398006","https://openalex.org/W394360790","https://openalex.org/W566315627","https://openalex.org/W641845919","https://openalex.org/W1520077026","https://openalex.org/W1536493828","https://openalex.org/W1536930200","https://openalex.org/W1550367722","https://openalex.org/W1566154368","https://openalex.org/W1770324186","https://openalex.org/W1812316405","https://openalex.org/W1872498068","https://openalex.org/W1965275036","https://openalex.org/W1978997608","https://openalex.org/W2017429418","https://openalex.org/W2619674633","https://openalex.org/W2795305715","https://openalex.org/W2951786898","https://openalex.org/W2964947050","https://openalex.org/W3101367291","https://openalex.org/W6641246623","https://openalex.org/W6738920706","https://openalex.org/W6763860005","https://openalex.org/W6765145253"],"related_works":["https://openalex.org/W3203142394","https://openalex.org/W2161474341","https://openalex.org/W4302615923","https://openalex.org/W1974101135","https://openalex.org/W2351061015","https://openalex.org/W2017509870","https://openalex.org/W4220731478","https://openalex.org/W2542937328","https://openalex.org/W1968289971","https://openalex.org/W4300588357"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2,62],"algorithm":[3,80],"that":[4,25,58],"is":[5,59,81],"able":[6],"to":[7,27,34,70,84],"speed":[8],"up":[9],"the":[10,23,40,66,71],"decoding":[11,39,57,75],"of":[12,51,88],"a":[13,16,35,44,48,56,95],"code":[14],"with":[15,94],"non-trivial":[17,96],"automorphism":[18,97],"group,":[19],"by":[20,61],"summing":[21],"for":[22,74],"word":[24,42],"has":[26],"be":[28],"decoded,":[29],"all":[30],"its":[31],"entries":[32],"belonging":[33],"same":[36],"orbit":[37],"and":[38],"resulting":[41],"in":[43,55,65],"reduced":[45],"code.":[46],"For":[47],"certain":[49],"range":[50],"parameters,":[52],"this":[53],"results":[54],"faster":[60],"exponential":[63],"factor":[64],"codelength":[67],"when":[68],"compared":[69],"best":[72],"algorithms":[73],"generic":[76],"linear":[77],"codes.":[78],"This":[79],"then":[82],"used":[83],"break":[85],"several":[86],"proposals":[87],"public-key":[89],"cryptosystems":[90],"based":[91],"on":[92],"codes":[93],"group.":[98]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}