{"id":"https://openalex.org/W2784141095","doi":"https://doi.org/10.1109/isit.2018.8437843","title":"The Decoding Failure Probability of MDPC Codes","display_name":"The Decoding Failure Probability of MDPC Codes","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2784141095","doi":"https://doi.org/10.1109/isit.2018.8437843","mag":"2784141095"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437843","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437843","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1801.04668","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Jean-Pierre Tillich","raw_affiliation_strings":["Inria, 2 rue Simone Iff, Paris, 75012, France"],"affiliations":[{"raw_affiliation_string":"Inria, 2 rue Simone Iff, Paris, 75012, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5060302693"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":0.59568738,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.71289292,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"941","last_page":"945"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"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.9998999834060669,"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.9993000030517578,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mceliece-cryptosystem","display_name":"McEliece cryptosystem","score":0.8938944339752197},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7158882021903992},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6329541802406311},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5523706674575806},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5002250671386719},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4689338505268097},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.45290407538414},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38902348279953003},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.384858638048172},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.35032111406326294},{"id":"https://openalex.org/keywords/cryptosystem","display_name":"Cryptosystem","score":0.33760905265808105},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29796546697616577}],"concepts":[{"id":"https://openalex.org/C16935551","wikidata":"https://www.wikidata.org/wiki/Q1042583","display_name":"McEliece cryptosystem","level":4,"score":0.8938944339752197},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7158882021903992},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6329541802406311},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5523706674575806},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5002250671386719},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4689338505268097},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.45290407538414},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38902348279953003},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.384858638048172},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.35032111406326294},{"id":"https://openalex.org/C6295992","wikidata":"https://www.wikidata.org/wiki/Q976521","display_name":"Cryptosystem","level":3,"score":0.33760905265808105},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29796546697616577},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/isit.2018.8437843","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437843","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1801.04668","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1801.04668","pdf_url":"https://arxiv.org/pdf/1801.04668","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:2784141095","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1801.04668","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-01957037v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01957037","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISIT 2018 - IEEE International Symposium on Information Theory, Jun 2018, Vail, United States. pp.941-945, ⟨10.1109/ISIT.2018.8437843⟩","raw_type":"Conference papers"},{"id":"doi:10.48550/arxiv.1801.04668","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1801.04668","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1801.04668","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1801.04668","pdf_url":"https://arxiv.org/pdf/1801.04668","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1508634734","https://openalex.org/W1510132879","https://openalex.org/W1964723977","https://openalex.org/W1965275036","https://openalex.org/W1966655096","https://openalex.org/W2093465763","https://openalex.org/W2100123008","https://openalex.org/W2103398070","https://openalex.org/W2116941002","https://openalex.org/W2128765501","https://openalex.org/W2150802958","https://openalex.org/W2168676717","https://openalex.org/W2520683369","https://openalex.org/W2919070251","https://openalex.org/W4300188436","https://openalex.org/W6681756610","https://openalex.org/W6738974170","https://openalex.org/W6744264511","https://openalex.org/W6747904050"],"related_works":["https://openalex.org/W2963603795","https://openalex.org/W3105513639","https://openalex.org/W2951261667","https://openalex.org/W2148599432","https://openalex.org/W1986921475","https://openalex.org/W2949757127","https://openalex.org/W3021884465","https://openalex.org/W2781017182","https://openalex.org/W2949560198","https://openalex.org/W2991546740","https://openalex.org/W3001795748","https://openalex.org/W2951729012","https://openalex.org/W2591132373","https://openalex.org/W2768757091","https://openalex.org/W3081454597","https://openalex.org/W3206652453","https://openalex.org/W2783514811","https://openalex.org/W2184280405","https://openalex.org/W2001659896","https://openalex.org/W3030412028"],"abstract_inverted_index":{"Moderate":[0],"Density":[1],"Parity":[2],"Check":[3],"(MDPC)":[4],"codes":[5,10,36,136],"are":[6],"defined":[7],"here":[8,115],"as":[9],"which":[11,227],"have":[12,64,77,92],"a":[13,127,140,175],"parity-check":[14],"matrix":[15],"whose":[16],"row":[17],"weight":[18],"is":[19,23,56,111,228,237],"$O(\\sqrt{n})$":[20],"where":[21],"$n$":[22,26],"the":[24,28,46,89,104,107,124,155,159,164,168,179,187,221,224,233],"length":[25],"of":[27,48,57,146,161,167,193,212,223,235],"code.":[29],"They":[30,76],"can":[31,51,119,137],"be":[32,120],"decoded":[33],"like":[34],"LDPC":[35,44],"but":[37],"they":[38,50,63],"decode":[39,52,138],"much":[40],"less":[41],"errors":[42,49],"than":[43],"codes:":[45],"number":[47,211],"in":[53,69,81,86,95,99,126,218],"this":[54,61,87,117,219],"case":[55,220],"order":[58],"$\u0398(\\sqrt{n})$.":[59],"Despite":[60],"fact":[62,105],"been":[65,79,93,202],"proved":[66,203],"very":[67,176],"useful":[68],"cryptography":[70],"for":[71,230],"devising":[72],"key":[73,165,225],"exchange":[74],"mechanisms.":[75],"also":[78],"proposed":[80,94],"McEliece":[82],"type":[83],"cryptosystems.":[84],"However":[85],"case,":[88],"parameters":[90,125],"that":[91,106,116,134,173,204,217],"\\cite{MTSB13}":[96],"were":[97],"broken":[98],"\\cite{GJS16}.":[100],"This":[101,153],"attack":[102,118,157,234],"exploits":[103],"decoding":[108,180],"failure":[109,181],"probability":[110,182],"non-negligible.":[112],"We":[113,131,170],"show":[114,133,172,216],"thwarted":[121],"by":[122],"choosing":[123],"more":[128],"conservative":[129],"way.":[130],"first":[132],"such":[135],"with":[139,186,189,208],"simple":[141],"bit-flipping":[142],"decoder":[143],"any":[144],"pattern":[145],"$O\\left(\\frac{\\sqrt{n}":[147],"\\log":[148,149],"n}{\\log":[150],"n}\\right)$":[151],"errors.":[152],"avoids":[154],"previous":[156],"at":[158],"cost":[160],"significantly":[162],"increasing":[163],"size":[166,226],"scheme.":[169],"then":[171],"under":[174],"reasonable":[177],"assumption":[178,198],"decays":[183,206],"almost":[184],"exponentially":[185,207],"codelength":[188],"just":[190],"two":[191],"iterations":[192,213],"bit-flipping.":[194],"With":[195],"an":[196,209],"additional":[197],"it":[199,205],"has":[200],"even":[201],"unbounded":[210],"and":[214],"we":[215],"increase":[222],"required":[229],"resisting":[231],"to":[232],"\\cite{GJS16}":[236],"only":[238],"moderate.":[239]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}