Family of Constrained Codes for Archival DNA Data Storage
DNA-based data storage systems have evolved as a solution to accommodate data explosion. In this letter, some properties of DNA codewords that are essential for an archival DNA storage are considered for the design of codes. Constraint-based DNA codes, which avoid runs of nucleotides, have fixed GC-...
Gespeichert in:
| Veröffentlicht in: | IEEE communications letters 2018-10, Vol.22 (10), p.1972-1975 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1975 |
|---|---|
| container_issue | 10 |
| container_start_page | 1972 |
| container_title | IEEE communications letters |
| container_volume | 22 |
| creator | Limbachiya, Dixita Gupta, Manish K. Aggarwal, Vaneet |
| description | DNA-based data storage systems have evolved as a solution to accommodate data explosion. In this letter, some properties of DNA codewords that are essential for an archival DNA storage are considered for the design of codes. Constraint-based DNA codes, which avoid runs of nucleotides, have fixed GC-weight, and a specific minimum distance is presented. An altruistic algorithm that enumerates DNA codewords with the above constraints is provided. A theoretical bound on such DNA codewords is obtained. This bound is tight when there is no minimum distance constraint. |
| doi_str_mv | 10.1109/LCOMM.2018.2861867 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_LCOMM_2018_2861867</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8424143</ieee_id><sourcerecordid>2118049177</sourcerecordid><originalsourceid>FETCH-LOGICAL-c454t-a092b92c53812d1b02a7540a3a3b7840397e0df8b8fed6ddf9fb9c639e86ad0c3</originalsourceid><addsrcrecordid>eNo9kE1PAjEQhhujiYj-Ab008bw4_djt9EgWUROQg3puuttWlwCL7WLCv3cR4mXmPbzPTPIQcstgxBjoh1m5mM9HHBiOOBYMC3VGBizPMeP9OO8zoM6U0nhJrlJaAgDynA2Intp1s9rTNtCy3aQu2mbjXZ-dTzS0kY5j_dX82BWdvI7pxHaWvnVttJ_-mlwEu0r-5rSH5GP6-F4-Z7PF00s5nmW1zGWXWdC80rzOBTLuWAXcqlyCFVZUCiUIrTy4gBUG7wrngg6VrguhPRbWQS2G5P54dxvb751PnVm2u7jpXxrOGILUTKm-xY-tOrYpRR_MNjZrG_eGgTkoMn-KzEGROSnqobsj1Hjv_wGUXDIpxC8db2DA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2118049177</pqid></control><display><type>article</type><title>Family of Constrained Codes for Archival DNA Data Storage</title><source>IEEE Electronic Library (IEL)</source><creator>Limbachiya, Dixita ; Gupta, Manish K. ; Aggarwal, Vaneet</creator><creatorcontrib>Limbachiya, Dixita ; Gupta, Manish K. ; Aggarwal, Vaneet</creatorcontrib><description>DNA-based data storage systems have evolved as a solution to accommodate data explosion. In this letter, some properties of DNA codewords that are essential for an archival DNA storage are considered for the design of codes. Constraint-based DNA codes, which avoid runs of nucleotides, have fixed GC-weight, and a specific minimum distance is presented. An altruistic algorithm that enumerates DNA codewords with the above constraints is provided. A theoretical bound on such DNA codewords is obtained. This bound is tight when there is no minimum distance constraint.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2018.2861867</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>3G mobile communication ; Biological evolution ; Codes ; constrained codes ; Data storage ; Deoxyribonucleic acid ; DNA ; DNA codes ; DNA storage ; Electronic mail ; Encoding ; Memory ; Nucleotides ; Sequential analysis ; Storage systems ; Weight ; Writing</subject><ispartof>IEEE communications letters, 2018-10, Vol.22 (10), p.1972-1975</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c454t-a092b92c53812d1b02a7540a3a3b7840397e0df8b8fed6ddf9fb9c639e86ad0c3</citedby><cites>FETCH-LOGICAL-c454t-a092b92c53812d1b02a7540a3a3b7840397e0df8b8fed6ddf9fb9c639e86ad0c3</cites><orcidid>0000-0001-9131-4723 ; 0000-0001-7067-8085 ; 0000-0001-5184-1123</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8424143$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8424143$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Limbachiya, Dixita</creatorcontrib><creatorcontrib>Gupta, Manish K.</creatorcontrib><creatorcontrib>Aggarwal, Vaneet</creatorcontrib><title>Family of Constrained Codes for Archival DNA Data Storage</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>DNA-based data storage systems have evolved as a solution to accommodate data explosion. In this letter, some properties of DNA codewords that are essential for an archival DNA storage are considered for the design of codes. Constraint-based DNA codes, which avoid runs of nucleotides, have fixed GC-weight, and a specific minimum distance is presented. An altruistic algorithm that enumerates DNA codewords with the above constraints is provided. A theoretical bound on such DNA codewords is obtained. This bound is tight when there is no minimum distance constraint.</description><subject>3G mobile communication</subject><subject>Biological evolution</subject><subject>Codes</subject><subject>constrained codes</subject><subject>Data storage</subject><subject>Deoxyribonucleic acid</subject><subject>DNA</subject><subject>DNA codes</subject><subject>DNA storage</subject><subject>Electronic mail</subject><subject>Encoding</subject><subject>Memory</subject><subject>Nucleotides</subject><subject>Sequential analysis</subject><subject>Storage systems</subject><subject>Weight</subject><subject>Writing</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE1PAjEQhhujiYj-Ab008bw4_djt9EgWUROQg3puuttWlwCL7WLCv3cR4mXmPbzPTPIQcstgxBjoh1m5mM9HHBiOOBYMC3VGBizPMeP9OO8zoM6U0nhJrlJaAgDynA2Intp1s9rTNtCy3aQu2mbjXZ-dTzS0kY5j_dX82BWdvI7pxHaWvnVttJ_-mlwEu0r-5rSH5GP6-F4-Z7PF00s5nmW1zGWXWdC80rzOBTLuWAXcqlyCFVZUCiUIrTy4gBUG7wrngg6VrguhPRbWQS2G5P54dxvb751PnVm2u7jpXxrOGILUTKm-xY-tOrYpRR_MNjZrG_eGgTkoMn-KzEGROSnqobsj1Hjv_wGUXDIpxC8db2DA</recordid><startdate>20181001</startdate><enddate>20181001</enddate><creator>Limbachiya, Dixita</creator><creator>Gupta, Manish K.</creator><creator>Aggarwal, Vaneet</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0001-9131-4723</orcidid><orcidid>https://orcid.org/0000-0001-7067-8085</orcidid><orcidid>https://orcid.org/0000-0001-5184-1123</orcidid></search><sort><creationdate>20181001</creationdate><title>Family of Constrained Codes for Archival DNA Data Storage</title><author>Limbachiya, Dixita ; Gupta, Manish K. ; Aggarwal, Vaneet</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c454t-a092b92c53812d1b02a7540a3a3b7840397e0df8b8fed6ddf9fb9c639e86ad0c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>3G mobile communication</topic><topic>Biological evolution</topic><topic>Codes</topic><topic>constrained codes</topic><topic>Data storage</topic><topic>Deoxyribonucleic acid</topic><topic>DNA</topic><topic>DNA codes</topic><topic>DNA storage</topic><topic>Electronic mail</topic><topic>Encoding</topic><topic>Memory</topic><topic>Nucleotides</topic><topic>Sequential analysis</topic><topic>Storage systems</topic><topic>Weight</topic><topic>Writing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Limbachiya, Dixita</creatorcontrib><creatorcontrib>Gupta, Manish K.</creatorcontrib><creatorcontrib>Aggarwal, Vaneet</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Limbachiya, Dixita</au><au>Gupta, Manish K.</au><au>Aggarwal, Vaneet</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Family of Constrained Codes for Archival DNA Data Storage</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2018-10-01</date><risdate>2018</risdate><volume>22</volume><issue>10</issue><spage>1972</spage><epage>1975</epage><pages>1972-1975</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>DNA-based data storage systems have evolved as a solution to accommodate data explosion. In this letter, some properties of DNA codewords that are essential for an archival DNA storage are considered for the design of codes. Constraint-based DNA codes, which avoid runs of nucleotides, have fixed GC-weight, and a specific minimum distance is presented. An altruistic algorithm that enumerates DNA codewords with the above constraints is provided. A theoretical bound on such DNA codewords is obtained. This bound is tight when there is no minimum distance constraint.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2018.2861867</doi><tpages>4</tpages><orcidid>https://orcid.org/0000-0001-9131-4723</orcidid><orcidid>https://orcid.org/0000-0001-7067-8085</orcidid><orcidid>https://orcid.org/0000-0001-5184-1123</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1089-7798 |
| ispartof | IEEE communications letters, 2018-10, Vol.22 (10), p.1972-1975 |
| issn | 1089-7798 1558-2558 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_LCOMM_2018_2861867 |
| source | IEEE Electronic Library (IEL) |
| subjects | 3G mobile communication Biological evolution Codes constrained codes Data storage Deoxyribonucleic acid DNA DNA codes DNA storage Electronic mail Encoding Memory Nucleotides Sequential analysis Storage systems Weight Writing |
| title | Family of Constrained Codes for Archival DNA Data Storage |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T11%3A30%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Family%20of%20Constrained%20Codes%20for%20Archival%20DNA%20Data%20Storage&rft.jtitle=IEEE%20communications%20letters&rft.au=Limbachiya,%20Dixita&rft.date=2018-10-01&rft.volume=22&rft.issue=10&rft.spage=1972&rft.epage=1975&rft.pages=1972-1975&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2018.2861867&rft_dat=%3Cproquest_RIE%3E2118049177%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2118049177&rft_id=info:pmid/&rft_ieee_id=8424143&rfr_iscdi=true |