{"id":"https://openalex.org/W2742983946","doi":"https://doi.org/10.1109/isit.2017.8006839","title":"Statistical decoding","display_name":"Statistical decoding","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2742983946","doi":"https://doi.org/10.1109/isit.2017.8006839","mag":"2742983946"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006839","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006839","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":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1701.07416","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083024466","display_name":"Thomas Debris-Alazard","orcid":"https://orcid.org/0000-0001-8864-0245"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Thomas Debris-Alazard","raw_affiliation_strings":["SECRET Project, Inria, Paris Cedex, France","Inria, SECRET Project, 2 Rue Simone Iff 75012 Paris Cedex, France"],"affiliations":[{"raw_affiliation_string":"SECRET Project, Inria, Paris Cedex, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Inria, SECRET Project, 2 Rue Simone Iff 75012 Paris Cedex, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"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 informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Pierre Tillich","raw_affiliation_strings":["SECRET Project, Inria, Paris Cedex, France","Inria, SECRET Project, 2 Rue Simone Iff 75012 Paris Cedex, France"],"affiliations":[{"raw_affiliation_string":"SECRET Project, Inria, Paris Cedex, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Inria, SECRET Project, 2 Rue Simone Iff 75012 Paris Cedex, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083024466"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":0.7801,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79313802,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1798","last_page":"1802"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9997000098228455,"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.9997000098228455,"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/T10237","display_name":"Cryptography and Data Security","score":0.9958000183105469,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9934999942779541,"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.8658970594406128},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.7790072560310364},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.7428892254829407},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.6343015432357788},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6029648780822754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5768786072731018},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4933570921421051},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4593318998813629},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.4471403658390045},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.4138132333755493},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3355470895767212},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.20388826727867126},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.19530555605888367}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8658970594406128},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.7790072560310364},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7428892254829407},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.6343015432357788},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6029648780822754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5768786072731018},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4933570921421051},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4593318998813629},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.4471403658390045},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.4138132333755493},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3355470895767212},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.20388826727867126},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.19530555605888367},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1109/isit.2017.8006839","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006839","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"},{"id":"pmh:oai:arXiv.org:1701.07416","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.07416","pdf_url":"https://arxiv.org/pdf/1701.07416","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:3037429512","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1701.07416","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:HAL:hal-01661745v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01661745","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2017","raw_type":"Preprints, Working Papers, ..."},{"id":"pmh:oai:HAL:hal-01661749v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01661749","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISIT 2017 - IEEE International Symposium on Information Theory, Jun 2017, Aachen, Germany. pp.1789--1802, ⟨10.1109/ISIT.2017.8006839⟩","raw_type":"Conference papers"},{"id":"doi:10.48550/arxiv.1701.07416","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1701.07416","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"article"},{"id":"mag:2742983946","is_oa":false,"landing_page_url":"http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=8006839","pdf_url":null,"source":{"id":"https://openalex.org/S4306420160","display_name":"International Symposium on Information Theory","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":null,"is_accepted":false,"is_published":null,"raw_source_name":"International Symposium on Information Theory","raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1701.07416","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.07416","pdf_url":"https://arxiv.org/pdf/1701.07416","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W31442624","https://openalex.org/W72398006","https://openalex.org/W566315627","https://openalex.org/W1533379426","https://openalex.org/W1536493828","https://openalex.org/W2088668281","https://openalex.org/W2103398070","https://openalex.org/W2118847360","https://openalex.org/W2149839186","https://openalex.org/W4214600409","https://openalex.org/W6607176436"],"related_works":["https://openalex.org/W3037429512","https://openalex.org/W2093403978","https://openalex.org/W3009937129","https://openalex.org/W2533023245","https://openalex.org/W2951896729","https://openalex.org/W2967670694","https://openalex.org/W1551363121","https://openalex.org/W2184426788","https://openalex.org/W3155179867","https://openalex.org/W3182698378","https://openalex.org/W2793692225","https://openalex.org/W2999217642","https://openalex.org/W2215296657","https://openalex.org/W2260123238","https://openalex.org/W2977619799","https://openalex.org/W2186597778","https://openalex.org/W2951314354","https://openalex.org/W3102978093","https://openalex.org/W3084144892","https://openalex.org/W2963344999"],"abstract_inverted_index":{"The":[0,16],"security":[1],"of":[2,10,24,37,70,74,77,98,106],"code-based":[3],"cryptography":[4],"relies":[5],"primarily":[6],"on":[7,123,133],"the":[8,35,68,95,108,134],"hardness":[9],"generic":[11,18,47],"decoding":[12,19,40,48,89,132],"with":[13],"linear":[14],"codes.":[15],"best":[17],"algorithms":[20],"are":[21,32],"all":[22],"improvements":[23],"an":[25],"old":[26],"algorithm":[27,49,65],"due":[28],"to":[29,54,87,131],"Prange:":[30],"they":[31],"known":[33],"under":[34],"name":[36],"information":[38],"set":[39,73],"techniques":[41,117],"(ISD).":[42],"A":[43],"while":[44],"ago":[45],"a":[46,63,71,102,120],"which":[50],"does":[51],"not":[52],"belong":[53],"this":[55,88,99],"family":[56],"was":[57],"proposed:":[58],"statistical":[59],"decoding.":[60],"It":[61],"is":[62],"randomized":[64],"that":[66,127],"requires":[67],"computation":[69],"large":[72],"parity-check":[75,109],"equations":[76,110],"moderate":[78],"weight.":[79],"We":[80,91],"solve":[81],"here":[82],"several":[83],"open":[84],"problems":[85],"related":[86],"algorithm.":[90,144],"give":[92,101,119],"in":[93],"particular":[94],"asymptotic":[96],"complexity":[97,125],"algorithm,":[100],"rather":[103],"efficient":[104],"way":[105],"computing":[107],"needed":[111],"for":[112],"it":[113,129,137],"inspired":[114],"by":[115],"ISD":[116],"and":[118],"lower":[121],"bound":[122,136],"its":[124],"showing":[126],"when":[128],"comes":[130],"Gilbert-Varshamov":[135],"can":[138],"never":[139],"be":[140],"better":[141],"than":[142],"Prange's":[143]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}