{"id":"https://openalex.org/W4415367012","doi":"https://doi.org/10.1109/isit63088.2025.11195380","title":"BF-Max: an Efficient Bit Flipping Decoder with Predictable Decoding Failure Rate","display_name":"BF-Max: an Efficient Bit Flipping Decoder with Predictable Decoding Failure Rate","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367012","doi":"https://doi.org/10.1109/isit63088.2025.11195380"},"language":"en","primary_location":{"id":"doi:10.1109/isit63088.2025.11195380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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://hdl.handle.net/11566/350412","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Alessio Baldelli","orcid":null},"institutions":[{"id":"https://openalex.org/I122534668","display_name":"Marche Polytechnic University","ror":"https://ror.org/00x69rs40","country_code":"IT","type":"education","lineage":["https://openalex.org/I122534668"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Alessio Baldelli","raw_affiliation_strings":["Università Politecnica delle Marche,Dipartimento di Ingegneria dell'Informazione,Ancona,Italy"],"affiliations":[{"raw_affiliation_string":"Università Politecnica delle Marche,Dipartimento di Ingegneria dell'Informazione,Ancona,Italy","institution_ids":["https://openalex.org/I122534668"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108167671","display_name":"Marco Baldi","orcid":"https://orcid.org/0000-0002-8754-5526"},"institutions":[{"id":"https://openalex.org/I122534668","display_name":"Marche Polytechnic University","ror":"https://ror.org/00x69rs40","country_code":"IT","type":"education","lineage":["https://openalex.org/I122534668"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Marco Baldi","raw_affiliation_strings":["Università Politecnica delle Marche,Dipartimento di Ingegneria dell'Informazione,Ancona,Italy"],"affiliations":[{"raw_affiliation_string":"Università Politecnica delle Marche,Dipartimento di Ingegneria dell'Informazione,Ancona,Italy","institution_ids":["https://openalex.org/I122534668"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103097011","display_name":"Franco Chiaraluce","orcid":"https://orcid.org/0000-0001-6994-1448"},"institutions":[{"id":"https://openalex.org/I122534668","display_name":"Marche Polytechnic University","ror":"https://ror.org/00x69rs40","country_code":"IT","type":"education","lineage":["https://openalex.org/I122534668"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Franco Chiaraluce","raw_affiliation_strings":["Università Politecnica delle Marche,Dipartimento di Ingegneria dell'Informazione,Ancona,Italy"],"affiliations":[{"raw_affiliation_string":"Università Politecnica delle Marche,Dipartimento di Ingegneria dell'Informazione,Ancona,Italy","institution_ids":["https://openalex.org/I122534668"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017023508","display_name":"P. Santini","orcid":"https://orcid.org/0000-0002-1182-0173"},"institutions":[{"id":"https://openalex.org/I122534668","display_name":"Marche Polytechnic University","ror":"https://ror.org/00x69rs40","country_code":"IT","type":"education","lineage":["https://openalex.org/I122534668"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Paolo Santini","raw_affiliation_strings":["Università Politecnica delle Marche,Dipartimento di Ingegneria dell'Informazione,Ancona,Italy"],"affiliations":[{"raw_affiliation_string":"Università Politecnica delle Marche,Dipartimento di Ingegneria dell'Informazione,Ancona,Italy","institution_ids":["https://openalex.org/I122534668"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I122534668"],"apc_list":null,"apc_paid":null,"fwci":1.3676,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.8669029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13182","display_name":"Quantum-Dot Cellular Automata","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T13182","display_name":"Quantum-Dot Cellular Automata","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9922000169754028,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9869999885559082,"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.7680000066757202},{"id":"https://openalex.org/keywords/parity-bit","display_name":"Parity bit","score":0.63919997215271},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.47749999165534973},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46209999918937683},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4090999960899353},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.35089999437332153}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7680000066757202},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7202000021934509},{"id":"https://openalex.org/C131521367","wikidata":"https://www.wikidata.org/wiki/Q625502","display_name":"Parity bit","level":2,"score":0.63919997215271},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5871000289916992},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.47749999165534973},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46209999918937683},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4090999960899353},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.35089999437332153},{"id":"https://openalex.org/C56296756","wikidata":"https://www.wikidata.org/wiki/Q840922","display_name":"Bit error rate","level":3,"score":0.33160001039505005},{"id":"https://openalex.org/C2987812609","wikidata":"https://www.wikidata.org/wiki/Q194158","display_name":"Bit rate","level":2,"score":0.32330000400543213},{"id":"https://openalex.org/C117011727","wikidata":"https://www.wikidata.org/wiki/Q1278488","display_name":"Bit (key)","level":2,"score":0.3167000114917755},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31130000948905945},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C15927051","wikidata":"https://www.wikidata.org/wiki/Q246593","display_name":"Cryptographic primitive","level":4,"score":0.2768999934196472},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.25049999356269836}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit63088.2025.11195380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:iris.univpm.it:11566/350412","is_oa":true,"landing_page_url":"https://hdl.handle.net/11566/350412","pdf_url":null,"source":{"id":"https://openalex.org/S4306402571","display_name":"Universit\u00e0 Politecnica delle Marche (Universit\u00e0 Politecnica delle Marche)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122534668","host_organization_name":"Marche Polytechnic University","host_organization_lineage":["https://openalex.org/I122534668"],"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":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:iris.univpm.it:11566/350412","is_oa":true,"landing_page_url":"https://hdl.handle.net/11566/350412","pdf_url":null,"source":{"id":"https://openalex.org/S4306402571","display_name":"Universit\u00e0 Politecnica delle Marche (Universit\u00e0 Politecnica delle Marche)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122534668","host_organization_name":"Marche Polytechnic University","host_organization_lineage":["https://openalex.org/I122534668"],"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":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2128765501","https://openalex.org/W2520683369","https://openalex.org/W2740966734","https://openalex.org/W2795083828","https://openalex.org/W2949110138","https://openalex.org/W2956659484","https://openalex.org/W2963603795","https://openalex.org/W2963651700","https://openalex.org/W2965452800","https://openalex.org/W3017310612","https://openalex.org/W4401692085"],"related_works":[],"abstract_inverted_index":{"The":[0],"Bit-Flipping":[1],"(BF)":[2],"decoder,":[3,87],"thanks":[4],"to":[5,31,59,73,115,120,126,164],"its":[6],"very":[7,57],"low":[8,150],"computational":[9],"complexity,":[10],"is":[11,50,56,71,106,113],"widely":[12],"employed":[13],"in":[14,25,97],"post-quantum":[15],"cryptographic":[16],"schemes":[17],"based":[18],"on":[19],"Moderate":[20],"Density":[21],"Parity":[22],"Check":[23],"codes":[24],"which,":[26],"ultimately,":[27],"decryption":[28],"boils":[29],"down":[30],"syndrome":[32],"decoding.":[33],"In":[34,76],"such":[35],"a":[36,53,81,128],"setting,":[37],"for":[38],"security":[39],"concerns,":[40],"one":[41,101],"must":[42],"guarantee":[43],"that":[44,88,96,134,170],"the":[45,68,85,94,109,116,132],"Decoding":[46],"Failure":[47],"Rate":[48],"(DFR)":[49],"negligible.":[51],"Such":[52],"condition,":[54],"however,":[55],"difficult":[58,72],"guarantee,":[60],"because":[61],"simulations":[62],"are":[63,124,162,171],"of":[64,84,111,118,131,168],"little":[65],"help":[66],"and":[67,152],"decoder":[69],"performance":[70],"model":[74],"theoretically.":[75],"this":[77],"paper,":[78],"we":[79,89,123,161],"introduce":[80],"new":[82],"version":[83],"BF":[86],"call":[90],"BF-Max,":[91],"characterized":[92],"by":[93,177],"fact":[95],"each":[98],"iteration":[99],"only":[100],"bit":[102],"(the":[103],"least":[104],"reliable)":[105],"flipped.":[107],"When":[108],"number":[110,117],"iterations":[112],"equal":[114],"errors":[119],"be":[121,146],"corrected,":[122],"able":[125,163],"develop":[127],"theoretical":[129],"characterization":[130],"DFR":[133,169],"tightly":[135],"matches":[136],"with":[137],"numerical":[138],"simulations.":[139],"We":[140],"also":[141],"show":[142],"how":[143],"BF-Max":[144],"can":[145],"implemented":[147],"efficiently,":[148],"achieving":[149],"complexity":[151],"making":[153],"it":[154],"inherently":[155],"constant":[156],"time.":[157],"With":[158],"our":[159],"modeling,":[160],"accurately":[165],"predict":[166],"values":[167],"remarkably":[172],"lower":[173],"than":[174],"those":[175],"estimated":[176],"applying":[178],"other":[179],"approaches.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-17T18:11:37.981687","created_date":"2025-10-21T00:00:00"}