{"id":"https://openalex.org/W4415368221","doi":"https://doi.org/10.1109/isit63088.2025.11195425","title":"The Coverage Depth Problem in Dna Storage Over Small Alphabets","display_name":"The Coverage Depth Problem in Dna Storage Over Small Alphabets","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368221","doi":"https://doi.org/10.1109/isit63088.2025.11195425"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195425","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195425","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120072585","display_name":"Matteo Bertuzzo","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Matteo Bertuzzo","raw_affiliation_strings":["Eindhoven University of Technology,Dept. of Mathematics and Computer Science,the Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology,Dept. of Mathematics and Computer Science,the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025356502","display_name":"Alberto Ravagnani","orcid":"https://orcid.org/0000-0001-5901-9484"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alberto Ravagnani","raw_affiliation_strings":["Eindhoven University of Technology,Dept. of Mathematics and Computer Science,the Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology,Dept. of Mathematics and Computer Science,the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"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,Faculty of Computer Science,Israel"],"affiliations":[{"raw_affiliation_string":"Technion-Israel Institute of Technology,Faculty of Computer Science,Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5120072585"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34572605,"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":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.7748000025749207,"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.7748000025749207,"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/T12176","display_name":"Optimization and Packing Problems","score":0.6901000142097473,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.6837999820709229,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5044999718666077},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4999000132083893},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.4586000144481659},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.4262000024318695},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.37220001220703125},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.36800000071525574},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3582000136375427},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.3538999855518341}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5521000027656555},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5044999718666077},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4999000132083893},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4968999922275543},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4586000144481659},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.4262000024318695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4196000099182129},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.37220001220703125},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.36800000071525574},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3582000136375427},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3546000123023987},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3538999855518341},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.3463999927043915},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34209999442100525},{"id":"https://openalex.org/C194739806","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Computer data storage","level":2,"score":0.30630001425743103},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.30570000410079956},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.302700012922287},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2824999988079071},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.27720001339912415},{"id":"https://openalex.org/C24885549","wikidata":"https://www.wikidata.org/wiki/Q339678","display_name":"Distributed data store","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.26420000195503235},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.26010000705718994}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195425","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195425","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1469736541","display_name":null,"funder_award_id":"101045114","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1946587648","https://openalex.org/W2005830269","https://openalex.org/W2041788275","https://openalex.org/W2063121374","https://openalex.org/W2167461394","https://openalex.org/W2318076643","https://openalex.org/W2333320475","https://openalex.org/W2471091339","https://openalex.org/W2788257106","https://openalex.org/W2951269465","https://openalex.org/W2962809499","https://openalex.org/W2962880178","https://openalex.org/W2963561675","https://openalex.org/W2972936807","https://openalex.org/W4213456065","https://openalex.org/W4393497334","https://openalex.org/W4399207509","https://openalex.org/W4401693424","https://openalex.org/W4401693833","https://openalex.org/W4404294295","https://openalex.org/W4404788409"],"related_works":[],"abstract_inverted_index":{"The":[0,96],"coverage":[1,60],"depth":[2,61],"problem":[3,62],"in":[4,30,93],"DNA":[5],"data":[6,18],"storage":[7],"is":[8,19,43],"about":[9],"minimizing":[10],"the":[11,27,37,40,49,56,59,75,87,90],"expected":[12,76],"number":[13,77],"of":[14,51,63,78],"reads":[15,79],"until":[16],"all":[17],"recovered.":[20],"When":[21],"they":[22],"exist,":[23],"MDS":[24,52],"codes":[25,64],"offer":[26],"best":[28],"performance":[29,57],"this":[31],"context.":[32],"This":[33],"paper":[34],"focuses":[35],"on":[36],"scenario":[38],"where":[39],"base":[41],"field":[42],"not":[44],"large":[45],"enough":[46],"to":[47,103],"allow":[48],"existence":[50],"codes.":[53],"We":[54,84],"investigate":[55],"for":[58,74,80],"defined":[65],"over":[66],"a":[67],"small":[68],"finite":[69],"field,":[70],"providing":[71],"closed":[72],"formulas":[73],"various":[81],"code":[82],"families.":[83],"also":[85],"compare":[86],"results":[88],"with":[89],"theoretical":[91],"bounds":[92],"asymptotic":[94],"regimes.":[95],"techniques":[97],"we":[98],"apply":[99],"range":[100],"from":[101],"probability,":[102],"duality":[104],"theory":[105],"and":[106],"combinatorics.":[107]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}