{"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":false,"raw_author_name":"Canberk \u0130rima\u011fz\u0131","raw_affiliation_strings":["Institute of Applied Mathematics (IAM), Middle East Technical University, Ankara, Türkiye","Institute of Applied Mathematics (IAM), Middle East Technical University, Ankara, Turkey"],"raw_orcid":"https://orcid.org/0000-0002-2247-0738","affiliations":[{"raw_affiliation_string":"Institute of Applied Mathematics (IAM), Middle East Technical University, Ankara, Tü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ürkiye","Department of Electrical and Electronics Engineering, Middle East Technical University, Ankara, Turkey"],"raw_orcid":"https://orcid.org/0000-0002-8523-6754","affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Middle East Technical University, Ankara, Tü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":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I201799495"],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":1.1151,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77891611,"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/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":[],"funders":[],"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,117,192,211,250,287],"medium":[2],"for":[3,98,127,194,286],"cold":[4],"data":[5,26,70],"storage,":[6],"DNA":[7,35,46,80],"stands":[8],"out":[9],"as":[10,105],"it":[11,21],"promises":[12],"significant":[13],"gains":[14],"in":[15,69,204,227,283],"storage":[16],"capacity":[17],"and":[18,61,169,197],"lifetime.":[19],"However,":[20],"comes":[22],"with":[23,84,95,210,253,299],"its":[24],"own":[25],"processing":[27],"challenges":[28],"to":[29,44,54,66,166,173,276,296,301],"overcome.":[30],"Constrained":[31],"codes":[32,94,215,242,293],"over":[33],"the":[34,124,134,138,142,147,150,154,175,178,182,185,208,240,302],"alphabet":[36],"{A,":[37],"T,":[38],"G,":[39],"C}":[40],"have":[41],"been":[42],"used":[43],"design":[45],"sequences":[47],"that":[48,133,229],"are":[49,64,171,294],"free":[50],"of":[51,113,141,149,162,177,184,213,218],"long":[52],"homopolymers":[53],"increase":[55],"stability,":[56],"yet":[57],"effective":[58],"error":[59,62,85,96,128],"detection":[60],"correction":[63,97],"required":[65],"achieve":[67],"reliability":[68],"retrieval.":[71],"Recently,":[72],"we":[73,90,170,206],"introduced":[74],"lexicographically-ordered":[75],"constrained":[76,214,304],"(LOCO)":[77],"codes,":[78,83],"namely":[79],"LOCO":[81],"(D-LOCO)":[82],"detection.":[86],"In":[87],"this":[88,201],"paper,":[89],"equip":[91],"our":[92,290],"D-LOCO":[93,111,245,262,292],"substitution":[99,233],"errors":[100,196,259],"via":[101],"syndrome-like":[102],"decoding,":[103],"designated":[104],"residue":[106,148,183],"decoding.":[107],"We":[108,157,238,247],"only":[109],"use":[110],"codewords":[112],"indices":[114],"divisible":[115],"by":[116],"suitable":[118],"redundancy":[119,272],"metricR(m)":[120],">":[121,266],"0,":[122],"wheremis":[123],"code":[125],"length,":[126],"correction.":[129],"The":[130,271],"idea":[131],"is":[132,137,274],"residue,":[135],"which":[136,264],"index":[139,145,151,155,163,176,195],"moduloR(m),":[140],"received":[143,186],"word":[144,187],"equals":[146],"error,":[152],"i.e.,":[153,280],"difference.":[156],"find":[158],"an":[159],"exhaustive":[160],"list":[161],"differences":[164],"due":[165],"single-substitution":[167],"errors,":[168,234],"able":[172],"recover":[174],"original":[179],"codeword":[180],"from":[181],"index.":[188],"This":[189],"requires":[190],"storing":[191],"table":[193],"their":[198],"residues.":[199],"Having":[200],"decoding":[202],"algorithm":[203],"hand,":[205],"provide":[207],"community":[209],"construction":[212],"forbidding":[216],"runs":[217],"length":[219],"higher":[220],"than":[221],"fixed":[222],"\u2113":[223],"\u2208":[224],"{1,2,3}":[225],"andGC-content":[226],"[0.5\u22121/2K,0.5+1/2K]":[228],"correct":[230,257],"K":[231],"segmented":[232],"one":[235],"per":[236],"codeword.":[237],"call":[239],"proposed":[241],"error-correction":[243],"(EC)":[244],"codes.":[246],"also":[248],"give":[249],"list-decoding":[251],"procedure":[252],"near-quadratic":[254],"time-complexity":[255],"inmto":[256],"double-substitution":[258],"within":[260],"EC":[261,291],"codewords,":[263],"has":[265],"98.20%":[267],"average":[268],"success":[269],"rate.":[270],"metric":[273],"projected":[275,295],"require":[277],"2log2(m)+O(1)-bit":[278],"allocation,":[279],"2log2(m)+O(1)":[281],"reduction":[282],"message":[284],"bits,":[285],"length-mcodeword.":[288],"Hence,":[289],"be":[297],"capacity-approaching":[298],"respect":[300],"error-free":[303],"system.":[305]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}