On Duplication-Free Codes for Disjoint or Equal-Length Errors

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher

Abstract

AbstractMotivated by applications in DNA storage, we study a setting in which strings are affected by tandem-duplication errors. In particular, we look at two settings: disjoint tandem-duplication errors, and equal-length tandem-duplication errors. We construct codes, with positive asymptotic rate, for the two settings, as well as for their combination. Our constructions are duplication-free codes, comprising codewords that do not contain tandem duplications of specific lengths. Additionally, our codes generalize previous constructions, containing them as special cases. MSC Classification: 68R15 , 94B25 , 94B35
Full text 8,465 characters · extracted from preprint-html · click to expand
On Duplication-Free Codes for Disjoint or Equal-Length Errors | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article On Duplication-Free Codes for Disjoint or Equal-Length Errors Wenjun Yu, Moshe Schwartz This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-3849497/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Motivated by applications in DNA storage, we study a setting in which strings are affected by tandem-duplication errors. In particular, we look at two settings: disjoint tandem-duplication errors, and equal-length tandem-duplication errors. We construct codes, with positive asymptotic rate, for the two settings, as well as for their combination. Our constructions are duplication-free codes, comprising codewords that do not contain tandem duplications of specific lengths. Additionally, our codes generalize previous constructions, containing them as special cases. MSC Classification: 68R15 , 94B25 , 94B35 Error-correcting codes string-duplication systems duplication-free words Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-3849497","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":267423865,"identity":"d1767974-5a65-4dfa-b550-c613d629ce45","order_by":0,"name":"Wenjun Yu","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA7UlEQVRIiWNgGAWjYJACAwYGGzCDGSZy4AFhLWlgDQgtCYQtOoyqhQGfFoPjvQeKeXecz+PnP3+AueDXYQb+9gOMeG0xOHMuwZj3zO1iyRnJDMwz+w4zSJxJwO8wsxs5Bsa8bbcTN9wAOoy3B+jCGwT8Ynb/DUjLucQN5w9DtMgT1HKDB6TlQOKGA0CH8fw4zGBASIv9mRwDw7ltySC/GBye2ZDOY3gmsQGvFsn2M2YGb9vsgCF28OHjgj/WcnLHDx/+8AGPFiBgA0YlJCIOMLYx8DAwMDbg1wCMwgcM8Lj7Q0jxKBgFo2AUjEQAAKJJUPyr9MBdAAAAAElFTkSuQmCC","orcid":"","institution":"Ben-Gurion University of the Negev","correspondingAuthor":true,"prefix":"","firstName":"Wenjun","middleName":"","lastName":"Yu","suffix":""},{"id":267423866,"identity":"479ad4d1-9688-42df-a785-42f873d9c36f","order_by":1,"name":"Moshe Schwartz","email":"","orcid":"","institution":"Ben-Gurion University of the Negev","correspondingAuthor":false,"prefix":"","firstName":"Moshe","middleName":"","lastName":"Schwartz","suffix":""}],"badges":[],"createdAt":"2024-01-10 05:59:16","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-3849497/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-3849497/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":49722589,"identity":"ef2a051c-9ac3-4ed0-9732-aa1416a0ef41","added_by":"auto","created_at":"2024-01-17 02:25:58","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":320766,"visible":true,"origin":"","legend":"","description":"","filename":"Onduplicationfreecodes.pdf","url":"https://assets-eu.researchsquare.com/files/rs-3849497/v1_covered_5ab9294c-754c-425c-8b39-87f21c303841.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"On Duplication-Free Codes for Disjoint or Equal-Length Errors","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":true,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Error-correcting codes, string-duplication systems, duplication-free words","lastPublishedDoi":"10.21203/rs.3.rs-3849497/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-3849497/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eMotivated by applications in DNA storage, we study a setting in which strings are affected by tandem-duplication errors. In particular, we look at two settings: disjoint tandem-duplication errors, and equal-length tandem-duplication errors. We construct codes, with positive asymptotic rate, for the two settings, as well as for their combination. Our constructions are duplication-free codes, comprising codewords that do not contain tandem duplications of specific lengths. Additionally, our codes generalize previous constructions, containing them as special cases.\u003c/p\u003e\n\u003cp\u003eMSC Classification: 68R15 , 94B25 , 94B35\u003c/p\u003e","manuscriptTitle":"On Duplication-Free Codes for Disjoint or Equal-Length Errors","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-01-17 02:17:49","doi":"10.21203/rs.3.rs-3849497/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"f8e4a4fe-c1cc-4a97-84aa-840986333bd9","owner":[],"postedDate":"January 17th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2024-04-27T08:45:24+00:00","versionOfRecord":[],"versionCreatedAt":"2024-01-17 02:17:49","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-3849497","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-3849497","identity":"rs-3849497","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-26T02:00:01.498150+00:00
License: CC-BY-4.0