{"id":"https://openalex.org/W7092474407","doi":"https://doi.org/10.1109/isit63088.2025.11195438","title":"Threshold Selection for Iterative Decoding of $(v,\\ w)$-Regular Binary Codes","display_name":"Threshold Selection for Iterative Decoding of $(v,\\ w)$-Regular Binary Codes","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W7092474407","doi":"https://doi.org/10.1109/isit63088.2025.11195438"},"language":"en","primary_location":{"id":"doi:10.1109/isit63088.2025.11195438","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195438","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/11311/1289632","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Alessandro Annechini","orcid":null},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Alessandro Annechini","raw_affiliation_strings":["Politecnico di Milano,Department of Electronics, Information and Bioengineering - DEIB,Milano,Italy"],"affiliations":[{"raw_affiliation_string":"Politecnico di Milano,Department of Electronics, Information and Bioengineering - DEIB,Milano,Italy","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Alessandro Barenghi","orcid":null},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alessandro Barenghi","raw_affiliation_strings":["Politecnico di Milano,Department of Electronics, Information and Bioengineering - DEIB,Milano,Italy"],"affiliations":[{"raw_affiliation_string":"Politecnico di Milano,Department of Electronics, Information and Bioengineering - DEIB,Milano,Italy","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"last","author":{"id":null,"display_name":"Gerardo Pelosi","orcid":null},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gerardo Pelosi","raw_affiliation_strings":["Politecnico di Milano,Department of Electronics, Information and Bioengineering - DEIB,Milano,Italy"],"affiliations":[{"raw_affiliation_string":"Politecnico di Milano,Department of Electronics, Information and Bioengineering - DEIB,Milano,Italy","institution_ids":["https://openalex.org/I93860229"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I93860229"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.57202257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.613099992275238,"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.613099992275238,"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.20739999413490295,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.1420000046491623,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7572000026702881},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5600000023841858},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5077000260353088},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.48840001225471497},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.4645000100135803},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.45080000162124634},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4424999952316284},{"id":"https://openalex.org/keywords/binary-data","display_name":"Binary data","score":0.43779999017715454},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.42500001192092896}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7572000026702881},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6761999726295471},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5600000023841858},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5440000295639038},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5077000260353088},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.48840001225471497},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.4645000100135803},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.45080000162124634},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4424999952316284},{"id":"https://openalex.org/C2779190172","wikidata":"https://www.wikidata.org/wiki/Q4913888","display_name":"Binary data","level":3,"score":0.43779999017715454},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.42500001192092896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39149999618530273},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.3797000050544739},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.36959999799728394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35580000281333923},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.35089999437332153},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.33820000290870667},{"id":"https://openalex.org/C25432639","wikidata":"https://www.wikidata.org/wiki/Q3711790","display_name":"Weight distribution","level":2,"score":0.3091999888420105},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.2939999997615814},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.2915000021457672},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.26179999113082886},{"id":"https://openalex.org/C56296756","wikidata":"https://www.wikidata.org/wiki/Q840922","display_name":"Bit error rate","level":3,"score":0.25609999895095825},{"id":"https://openalex.org/C185588885","wikidata":"https://www.wikidata.org/wiki/Q7553811","display_name":"Soft-decision decoder","level":3,"score":0.25540000200271606},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.25529998540878296},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.25270000100135803}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit63088.2025.11195438","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195438","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:re.public.polimi.it:11311/1289632","is_oa":true,"landing_page_url":"https://hdl.handle.net/11311/1289632","pdf_url":null,"source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"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:re.public.polimi.it:11311/1289632","is_oa":true,"landing_page_url":"https://hdl.handle.net/11311/1289632","pdf_url":null,"source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"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":[{"id":"https://metadata.un.org/sdg/16","score":0.6829163432121277,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1965275036","https://openalex.org/W2035929826","https://openalex.org/W2126276563","https://openalex.org/W2128765501","https://openalex.org/W4385654261","https://openalex.org/W4401692085"],"related_works":[],"abstract_inverted_index":{"Iterative":[0],"bit":[1,51,86],"flipping":[2,52,87],"decoders":[3],"are":[4,30],"an":[5],"efficient":[6,36],"and":[7,27,39,73,89,127],"effective":[8],"choice":[9],"for":[10,35,93,112],"decoding":[11,48,132],"codes":[12],"which":[13,24],"admit":[14],"a":[15,81,98,107],"sparse":[16,21],"parity-check":[17],"matrix.":[18],"Among":[19],"these,":[20],"(v,w)-regular":[22],"codes,":[23,29],"include":[25],"LDPC":[26],"MDPC":[28],"of":[31,42,115,119],"particular":[32],"interest":[33],"both":[34],"data":[37],"correction":[38],"the":[40,46,50,61,69,113,116,120,123,131],"design":[41],"cryptographic":[43],"primitives.":[44],"Throughout":[45],"iterative":[47],"process,":[49],"thresholds":[53],"can":[54],"be":[55],"determined":[56],"either":[57],"statically":[58],"or":[59],"during":[60],"decoder":[62,88,125],"execution,":[63],"by":[64,97],"using":[65],"information":[66],"coming":[67],"from":[68],"initial":[70],"syndrome":[71,121],"value":[72],"its":[74],"updates.":[75],"In":[76,102],"this":[77],"work,":[78],"we":[79,105],"analyze":[80],"two-iterations":[82],"parallel":[83],"hard":[84],"decision":[85],"propose":[90],"concrete":[91],"criteria":[92],"threshold":[94],"determination,":[95],"backed":[96],"closed":[99],"form":[100],"model.":[101],"doing":[103],"so,":[104],"introduce":[106],"new":[108],"tightly":[109],"fitting":[110],"model":[111],"distribution":[114],"Hamming":[117],"weight":[118],"after":[122],"first":[124],"iteration":[126],"substantial":[128],"improvements":[129],"on":[130],"failure":[133],"rate":[134],"(DFR)":[135],"estimation":[136],"with":[137],"respect":[138],"to":[139],"existing":[140],"approaches.":[141]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-21T00:00:00"}