"Galaxy" encoding: toward high storage density and low cost.

Abstract

DNA is considered one of the most attractive storage media because of its excellent reliability and durability. Early encoding schemes lacked flexibility and scalability. To address these limitations, we propose a combination of static mapping and dynamic encoding, named "Galaxy" encoding. This scheme uses both the "dual-rule interleaving" algorithm and the "twelve-element Huffman rotational encoding" algorithm. We tested it with "Shakespeare Sonnets" and other files, achieving an encoding information density of approximately 2.563 bits/nt. Additionally, the inclusion of Reed-Solomon error-correcting codes can correct nearly 5% of the errors. Our simulations show that it supports various file types (.gz, .tar, .exe, etc.). We also analyzed the cost and fault tolerance of "Galaxy" encoding, demonstrating its high coding efficiency and ability to fully recover original information while effectively reducing the costs of DNA synthesis and sequencing.