{"id":"https://openalex.org/W4401699112","doi":"https://doi.org/10.1109/isit57864.2024.10619415","title":"One Code Fits All: Strong Stuck-At Codes for Versatile Memory Encoding","display_name":"One Code Fits All: Strong Stuck-At Codes for Versatile Memory Encoding","publication_year":2024,"publication_date":"2024-07-07","ids":{"openalex":"https://openalex.org/W4401699112","doi":"https://doi.org/10.1109/isit57864.2024.10619415"},"language":"en","primary_location":{"id":"doi:10.1109/isit57864.2024.10619415","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit57864.2024.10619415","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Symposium on Information Theory (ISIT)","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/A5025677091","display_name":"Roni Con","orcid":"https://orcid.org/0000-0002-0966-3818"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Roni Con","raw_affiliation_strings":["Technion - Israel Institute of Technology,Haifa,Israel"],"affiliations":[{"raw_affiliation_string":"Technion - Israel Institute of Technology,Haifa,Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008430584","display_name":"Ryan Gabrys","orcid":"https://orcid.org/0000-0002-9197-3371"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ryan Gabrys","raw_affiliation_strings":["University of California San Diego"],"affiliations":[{"raw_affiliation_string":"University of California San Diego","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021586372","display_name":"Eitan Yaakobi","orcid":"https://orcid.org/0000-0002-9851-5234"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eitan Yaakobi","raw_affiliation_strings":["Technion - Israel Institute of Technology,Haifa,Israel"],"affiliations":[{"raw_affiliation_string":"Technion - Israel Institute of Technology,Haifa,Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025677091"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.3626,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.6571039,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2634","last_page":"2639"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9879000186920166,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9879000186920166,"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.9878000020980835,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/computer-science","display_name":"Computer science","score":0.7259843945503235},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.6891873478889465},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5450996160507202},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4750285744667053},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.46844935417175293},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3546517491340637},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33313047885894775},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10649409890174866}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7259843945503235},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.6891873478889465},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5450996160507202},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4750285744667053},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46844935417175293},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3546517491340637},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33313047885894775},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10649409890174866},{"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":1,"locations":[{"id":"doi:10.1109/isit57864.2024.10619415","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit57864.2024.10619415","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5021082111","display_name":null,"funder_award_id":"CCF2212437","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1651322423","https://openalex.org/W1743760387","https://openalex.org/W1970221790","https://openalex.org/W2018493795","https://openalex.org/W2022168080","https://openalex.org/W2025473704","https://openalex.org/W2123567113","https://openalex.org/W2163137752","https://openalex.org/W2283653978","https://openalex.org/W2980184622","https://openalex.org/W3100153153","https://openalex.org/W4401699112"],"related_works":["https://openalex.org/W4235381733","https://openalex.org/W2355022049","https://openalex.org/W2060429446","https://openalex.org/W2741782512","https://openalex.org/W3011302839","https://openalex.org/W2392958391","https://openalex.org/W3155227409","https://openalex.org/W2386709048","https://openalex.org/W2898682874","https://openalex.org/W2056396287"],"abstract_inverted_index":{"In":[0,24],"this":[1,50,97,127,154],"work":[2],"we":[3,17],"consider":[4,91],"a":[5,35,38,43,59,92],"generalization":[6],"of":[7,11,28,46,72,75,96,108,133,144,153],"the":[8,25,31,47,67,73,87,100,106,131,139],"well-studied":[9],"problem":[10,98],"coding":[12],"for":[13,85],"\u201cstuck-at\u201d":[14],"errors,":[15],"which":[16],"refer":[18],"to":[19,124,130],"as":[20],"\u201cstrong":[21],"stuck-at\u201d":[22],"codes.":[23],"traditional":[26],"framework":[27],"stuck-at":[29,145],"codes,":[30],"task":[32],"involves":[33],"encoding":[34,116],"message":[36],"into":[37],"one-dimensional":[39],"binary":[40],"vector.":[41],"However,":[42],"certain":[44],"number":[45],"bits":[48,77],"in":[49,126,158],"vector":[51],"are":[52,56],"\u2018frozen\u2019,":[53],"meaning":[54],"they":[55],"fixed":[57],"at":[58],"predetermined":[60],"value":[61],"and":[62,114,117],"cannot":[63],"be":[64],"altered":[65],"by":[66],"encoder.":[68],"The":[69,150],"decoder,":[70],"aware":[71],"proportion":[74],"frozen":[76,109],"but":[78],"not":[79,103],"their":[80],"specific":[81],"positions,":[82],"is":[83,138,156],"responsible":[84],"deciphering":[86],"intended":[88],"message.":[89],"We":[90,111],"more":[93],"challenging":[94],"version":[95,152],"where":[99],"decoder":[101],"does":[102],"even":[104],"know":[105],"fraction":[107],"bits.":[110],"construct":[112],"explicit":[113,142],"efficient":[115],"decoding":[118],"algorithms":[119],"that":[120,147],"get":[121],"arbitrarily":[122],"close":[123],"capacity":[125],"scenario.":[128],"Furthermore,":[129],"best":[132],"our":[134,136],"knowledge,":[135],"construction":[137,143],"first":[140],"fully":[141],"codes":[146],"approaches":[148],"capacity.":[149],"full":[151],"paper":[155],"given":[157],"[1].":[159]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-26T23:08:49.675405","created_date":"2025-10-10T00:00:00"}