Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2302.14627 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929207245799424 |
|---|---|
| author | G, NallappaBhavithran R, Selvakumar |
| author_facet | G, NallappaBhavithran R, Selvakumar |
| contents | DNA is a promising storage medium, but its stability and occurrence of Indel errors pose a significant challenge. The relative occurrence of Guanine(G) and Cytosine(C) in DNA is crucial for its longevity, and reverse complementary base pairs should be avoided to prevent the formation of a secondary structure in DNA strands. We overcome these challenges by selecting appropriate group homomorphisms. For storing and retrieving information in DNA strings we use kernel code and the Varshamov-Tenengolts algorithm. The Varshamov-Tenengolts algorithm corrects single indel errors. Additionally, we construct codes of any desired length (n) while calculating its reverse complement distance based on the value of n. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_14627 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | DNA digital data storage and retrieval using algebraic codes G, NallappaBhavithran R, Selvakumar Information Theory DNA is a promising storage medium, but its stability and occurrence of Indel errors pose a significant challenge. The relative occurrence of Guanine(G) and Cytosine(C) in DNA is crucial for its longevity, and reverse complementary base pairs should be avoided to prevent the formation of a secondary structure in DNA strands. We overcome these challenges by selecting appropriate group homomorphisms. For storing and retrieving information in DNA strings we use kernel code and the Varshamov-Tenengolts algorithm. The Varshamov-Tenengolts algorithm corrects single indel errors. Additionally, we construct codes of any desired length (n) while calculating its reverse complement distance based on the value of n. |
| title | DNA digital data storage and retrieval using algebraic codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2302.14627 |