{"id":"https://openalex.org/W4414692561","doi":"https://doi.org/10.1109/tcomm.2025.3616642","title":"LOCO Codes Can Correct as Well: Error-Correction Constrained Coding for DNA Data Storage","display_name":"LOCO Codes Can Correct as Well: Error-Correction Constrained Coding for DNA Data Storage","publication_year":2025,"publication_date":"2025-10-01","ids":{"openalex":"https://openalex.org/W4414692561","doi":"https://doi.org/10.1109/tcomm.2025.3616642"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2025.3616642","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2025.3616642","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2504.01262","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060716242","display_name":"Canberk \u0130rima\u011fz\u0131","orcid":"https://orcid.org/0000-0002-2247-0738"},"institutions":[{"id":"https://openalex.org/I201799495","display_name":"Middle East Technical University","ror":"https://ror.org/014weej12","country_code":"TR","type":"education","lineage":["https://openalex.org/I201799495"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Canberk \u0130rima\u011fz\u0131","raw_affiliation_strings":["Institute of Applied Mathematics (IAM), Middle East Technical University, Ankara, T&#x00FC;rkiye","Institute of Applied Mathematics (IAM), Middle East Technical University, Ankara, Turkey"],"affiliations":[{"raw_affiliation_string":"Institute of Applied Mathematics (IAM), Middle East Technical University, Ankara, T&#x00FC;rkiye","institution_ids":["https://openalex.org/I201799495"]},{"raw_affiliation_string":"Institute of Applied Mathematics (IAM), Middle East Technical University, Ankara, Turkey","institution_ids":["https://openalex.org/I201799495"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066643381","display_name":"Ahmed Hareedy","orcid":"https://orcid.org/0000-0002-8523-6754"},"institutions":[{"id":"https://openalex.org/I201799495","display_name":"Middle East Technical University","ror":"https://ror.org/014weej12","country_code":"TR","type":"education","lineage":["https://openalex.org/I201799495"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Ahmed Hareedy","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Middle East Technical University, Ankara, T&#x00FC;rkiye","Department of Electrical and Electronics Engineering, Middle East Technical University, Ankara, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Middle East Technical University, Ankara, T&#x00FC;rkiye","institution_ids":["https://openalex.org/I201799495"]},{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Middle East Technical University, Ankara, Turkey","institution_ids":["https://openalex.org/I201799495"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5060716242"],"corresponding_institution_ids":["https://openalex.org/I201799495"],"apc_list":null,"apc_paid":null,"fwci":1.534,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.84733129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"74","issue":null,"first_page":"2235","last_page":"2250"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9887999892234802,"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/T11269","display_name":"Algorithms and Data Compression","score":0.978600025177002,"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/code-word","display_name":"Code word","score":0.6841999888420105},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.6031000018119812},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5940999984741211},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5580000281333923},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.508899986743927},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4805999994277954},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.4156000018119812},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.35670000314712524},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.33410000801086426}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6841999888420105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6061999797821045},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.6031000018119812},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5997999906539917},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5940999984741211},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5580000281333923},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.508899986743927},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4805999994277954},{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.4156000018119812},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.35670000314712524},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.33410000801086426},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.3312000036239624},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32820001244544983},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.31150001287460327},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.30379998683929443},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.28769999742507935},{"id":"https://openalex.org/C76132124","wikidata":"https://www.wikidata.org/wiki/Q5474786","display_name":"Fountain code","level":5,"score":0.2815000116825104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2784999907016754},{"id":"https://openalex.org/C76862118","wikidata":"https://www.wikidata.org/wiki/Q1105671","display_name":"Coding gain","level":3,"score":0.27489998936653137},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.257099986076355},{"id":"https://openalex.org/C82047324","wikidata":"https://www.wikidata.org/wiki/Q177126","display_name":"DNA computing","level":3,"score":0.25290000438690186},{"id":"https://openalex.org/C40969351","wikidata":"https://www.wikidata.org/wiki/Q3516228","display_name":"Word error rate","level":2,"score":0.25099998712539673},{"id":"https://openalex.org/C137627569","wikidata":"https://www.wikidata.org/wiki/Q245471","display_name":"Cyclic redundancy check","level":3,"score":0.2508000135421753},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.2506999969482422}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tcomm.2025.3616642","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2025.3616642","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2504.01262","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.01262","pdf_url":"https://arxiv.org/pdf/2504.01262","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:https://open.metu.edu.tr:11511/116534","is_oa":true,"landing_page_url":"https://hdl.handle.net/11511/116534","pdf_url":null,"source":{"id":"https://openalex.org/S4306402495","display_name":"OpenMETU (Middle East Technical University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I201799495","host_organization_name":"Middle East Technical University","host_organization_lineage":["https://openalex.org/I201799495"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2504.01262","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.01262","pdf_url":"https://arxiv.org/pdf/2504.01262","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3844656448","display_name":null,"funder_award_id":"2232-B International Fellowship for Early Stage Re","funder_id":"https://openalex.org/F4320322626","funder_display_name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ft\u0131rma Kurumu"}],"funders":[{"id":"https://openalex.org/F4320322626","display_name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ft\u0131rma Kurumu","ror":"https://ror.org/04w9kkr77"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"As":[0],"a":[1,119,208,227,273,326],"medium":[2],"for":[3,100,138,210,325],"cold":[4],"data":[5,26,72],"storage,":[6],"DNA":[7,35,48,82],"stands":[8],"out":[9],"as":[10,107],"it":[11,21],"promises":[12],"significant":[13],"gains":[14],"in":[15,71,220,246,279,322],"storage":[16],"capacity":[17],"and":[18,63,185,213,242],"lifetime.":[19],"However,":[20],"comes":[22],"with":[23,86,97,226,276,341],"its":[24],"own":[25],"processing":[27],"challenges":[28],"to":[29,46,56,68,182,189,283,303,338,343],"overcome.":[30],"Constrained":[31],"codes":[32,96,231,265,335],"over":[33],"the":[34,135,145,149,158,163,166,170,191,194,198,201,224,263,344],"alphabet":[36],"{<italic":[37],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[38,124,126,132,153,155,244,248,250,281,306,308,310,315,317,319,328],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">A,":[39],"T,":[40],"G,":[41],"C</i>}":[42],"have":[43],"been":[44],"used":[45],"design":[47],"sequences":[49],"that":[50,144,252],"are":[51,66,187,336],"free":[52],"of":[53,115,157,165,178,193,200,229,234],"long":[54],"homopolymers":[55],"increase":[57],"stability,":[58],"yet":[59],"effective":[60],"error":[61,64,87,98,139],"detection":[62],"correction":[65,99],"required":[67],"achieve":[69],"reliability":[70],"retrieval.":[73],"Recently,":[74],"we":[75,92,186,222],"introduced":[76],"lexicographically-ordered":[77],"constrained":[78,230,346],"(LOCO)":[79],"codes,":[80,85],"namely":[81],"LOCO":[83],"(D-LOCO)":[84],"detection.":[88],"In":[89],"this":[90,217],"paper,":[91],"equip":[93],"our":[94,332],"D-LOCO":[95,113,268,289,334],"substitution":[101,256],"errors":[102,212,286],"via":[103],"syndrome-like":[104],"decoding,":[105],"designated":[106],"residue":[108,164,199],"decoding.":[109],"We":[110,173,261,270],"only":[111],"use":[112],"codewords":[114],"indices":[116],"divisible":[117],"by":[118],"suitable":[120],"redundancy":[121,299],"metric":[122,300],"<italic":[123,131,152,243,280],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">R</i>(<italic":[125,154],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m</i>)":[127],">":[128,293],"0,":[129],"where":[130],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m</i>":[133,282,329],"is":[134,143,148,301],"code":[136],"length,":[137],"correction.":[140],"The":[141,298],"idea":[142],"residue,":[146],"which":[147,291],"index":[150,161,167,171,179,192,211],"modulo":[151],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m</i>),":[156],"received":[159,202],"word":[160,203],"equals":[162],"error,":[168],"i.e.,":[169,313],"difference.":[172],"find":[174],"an":[175],"exhaustive":[176],"list":[177],"differences":[180],"due":[181],"single-substitution":[183],"errors,":[184,257],"able":[188],"recover":[190],"original":[195],"codeword":[196],"from":[197],"index.":[204],"This":[205],"requires":[206],"storing":[207],"table":[209],"their":[214],"residues.":[215],"Having":[216],"decoding":[218],"algorithm":[219],"hand,":[221],"provide":[223],"community":[225],"construction":[228],"forbidding":[232],"runs":[233],"length":[235],"higher":[236],"than":[237],"fixed":[238],"\u2113":[239],"\u2208":[240],"{1,2,3}":[241],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">GC</i>-content":[245],"[0.5\u22121/2<italic":[247],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">K</i>,0.5+1/2<italic":[249],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">K</i>]":[251],"correct":[253,284],"K":[254],"segmented":[255],"one":[258],"per":[259],"codeword.":[260,330],"call":[262],"proposed":[264],"error-correction":[266],"(EC)":[267],"codes.":[269],"also":[271],"give":[272],"list-decoding":[274],"procedure":[275],"near-quadratic":[277],"time-complexity":[278],"double-substitution":[285],"within":[287],"EC":[288,333],"codewords,":[290],"has":[292],"98.20%":[294],"average":[295],"success":[296],"rate.":[297],"projected":[302,337],"require":[304],"2log<sub":[305,314],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>(<italic":[307,316],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m</i>)+<italic":[309,318],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">O</i>(1)-bit":[311],"allocation,":[312],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">O</i>(1)":[320],"reduction":[321],"message":[323],"bits,":[324],"length-<italic":[327],"Hence,":[331],"be":[339],"capacity-approaching":[340],"respect":[342],"error-free":[345],"system.":[347]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}