{"id":"https://openalex.org/W4416725484","doi":"https://doi.org/10.1109/dft66274.2025.11257573","title":"Improved Encoding and Decoding of Optimal $m$-Out-of-$n$ Codes","display_name":"Improved Encoding and Decoding of Optimal $m$-Out-of-$n$ Codes","publication_year":2025,"publication_date":"2025-10-21","ids":{"openalex":"https://openalex.org/W4416725484","doi":"https://doi.org/10.1109/dft66274.2025.11257573"},"language":null,"primary_location":{"id":"doi:10.1109/dft66274.2025.11257573","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dft66274.2025.11257573","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 Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)","raw_type":"proceedings-article"},"type":"article","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/A5120567469","display_name":"Benjamin Gl\u00e4tzer","orcid":null},"institutions":[{"id":"https://openalex.org/I176453806","display_name":"University of Potsdam","ror":"https://ror.org/03bnmw459","country_code":"DE","type":"education","lineage":["https://openalex.org/I176453806"]},{"id":"https://openalex.org/I2800638415","display_name":"University of Applied Sciences Potsdam","ror":"https://ror.org/012m9bp23","country_code":"DE","type":"education","lineage":["https://openalex.org/I2800638415"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Benjamin Gl\u00e4tzer","raw_affiliation_strings":["Institute of Computer Science, University of Potsdam,Research Group Fault-tolerant Computing,Potsdam,Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Potsdam,Research Group Fault-tolerant Computing,Potsdam,Germany","institution_ids":["https://openalex.org/I176453806","https://openalex.org/I2800638415"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109008006","display_name":"Alexander Behrens","orcid":null},"institutions":[{"id":"https://openalex.org/I2800638415","display_name":"University of Applied Sciences Potsdam","ror":"https://ror.org/012m9bp23","country_code":"DE","type":"education","lineage":["https://openalex.org/I2800638415"]},{"id":"https://openalex.org/I176453806","display_name":"University of Potsdam","ror":"https://ror.org/03bnmw459","country_code":"DE","type":"education","lineage":["https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Benedict Behrens","raw_affiliation_strings":["Institute of Computer Science, University of Potsdam,Research Group Fault-tolerant Computing,Potsdam,Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Potsdam,Research Group Fault-tolerant Computing,Potsdam,Germany","institution_ids":["https://openalex.org/I176453806","https://openalex.org/I2800638415"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5120567469"],"corresponding_institution_ids":["https://openalex.org/I176453806","https://openalex.org/I2800638415"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.44161855,"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":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9850000143051147,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9850000143051147,"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/T10472","display_name":"Semiconductor materials and devices","score":0.00570000009611249,"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/T11005","display_name":"Radiation Effects in Electronics","score":0.004000000189989805,"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.7882999777793884},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.6453999876976013},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.6011999845504761},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.34610000252723694},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.34139999747276306}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7882999777793884},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6983000040054321},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.6453999876976013},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6244999766349792},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.6011999845504761},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.34139999747276306},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32829999923706055},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.29789999127388},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.27149999141693115},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2680000066757202}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dft66274.2025.11257573","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dft66274.2025.11257573","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 Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2010531778","https://openalex.org/W2026712187","https://openalex.org/W2068651225","https://openalex.org/W2098128943","https://openalex.org/W2102346142","https://openalex.org/W2125636047","https://openalex.org/W2141655375","https://openalex.org/W2155622784","https://openalex.org/W3107500289","https://openalex.org/W3118614175"],"related_works":[],"abstract_inverted_index":{"Errors":[0],"in":[1,89],"non-volatile":[2],"flash":[3],"memories":[4],"attributed":[5],"to":[6,31,87,120,138],"aging":[7],"effects":[8],"often":[9],"have":[10],"an":[11,54,111],"asymmetric":[12],"behavior.":[13],"In":[14],"many":[15,140],"applications":[16],"unidirectional":[17],"error":[18],"detecting":[19],"codes,":[20,44],"like":[21],"the":[22,76,80,96,99,121,130,139],"<tex":[23,39,50],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[24,26,40,42,51],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$m$</tex>-out-of-<tex":[25,41],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[27,43,52],"code,":[28],"are":[29,61],"used":[30],"improve":[32],"reliability.":[33],"The":[34],"encoding":[35],"and":[36,72,142],"decoding":[37],"of":[38,49,82,101,116,126,144],"particularly":[45],"for":[46,95],"larger":[47],"values":[48],"is":[53,93,125],"algorithmically":[55],"difficult":[56],"problem.":[57],"Most":[58],"coding":[59,84,117],"algorithms":[60],"based":[62],"on":[63],"a":[64],"serial":[65],"complementation":[66],"scheme":[67],"by":[68],"Knuth.":[69],"These":[70],"modifications":[71,143],"improvements":[73,141],"mainly":[74],"reduce":[75],"necessary":[77],"redundancy,":[78],"at":[79],"cost":[81],"increased":[83],"complexity.":[85],"Contrary":[86],"this,":[88],"this":[90,145],"paper":[91],"it":[92],"shown":[94],"first":[97],"how":[98],"number":[100],"iterations":[102],"can":[103,133],"be":[104,135],"significantly":[105],"reduced.":[106],"Our":[107],"experimental":[108],"results":[109],"show":[110],"over":[112],"50":[113],"percent":[114],"reduction":[115],"time":[118],"compared":[119],"basic":[122,146],"algorithm.":[123,147],"It":[124],"special":[127],"interest":[128],"that":[129],"developed":[131],"method":[132],"also":[134],"successfully":[136],"applied":[137]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-11-25T00:00:00"}