The biggest challenge when using DNA as a storage medium is maintaining its stability. The relative occurrence of Guanine (G) and Cytosine (C) is essential for the longevity of DNA. In addition to that, reverse complementary base pairs should not be present in the code. These challenges are overcome by a proper choice of group homomorphisms. Algorithms for storage and retrieval of information in DNA stings are written by using kernel code. Complexities of these algorithms are less compared to the existing algorithms. Construction procedures followed in this paper are capable of constructing codes of required sizes and Reverse complement distance.

翻译：使用DNA作为存储介质时面临的最大挑战是维持其稳定性。鸟嘌呤（G）和胞嘧啶（C）的相对含量对于DNA的长期保存至关重要。此外，编码中不应出现反向互补碱基对。通过合理选择群同态可克服这些挑战。本文利用核编码实现了DNA信息存储与检索算法，其复杂度低于现有算法。本文所采用的构造方法能够构建所需尺寸和反向互补距离的编码。