This is used in ITA 2024

Dense and durable, DNA offers a promising avenue for storing big data for a long time. Designing a good DNA-based data storage system, however, is as challenging as minimizing synthesis time, watching for GC balance, avoiding long homopolymers and secondary structures, fixing substitution-insertion-deletion errors, and taking advantage of the sampling reader all at the same time. In this talk, we use a polar code to protect the ith symbols of the DNA strands for each position i. Because polar codes achieve capacity, our construction achieves, assuming perfect indexing, the capacity derived by Lenz, Siegel, Wachter-Zeh, and Yaakobi. And because polar codes can work with any input distribution, our construction provides a flexible interface to avoid bad patterns.

The .epa file belongs to Endless Paper. Search infinite zoom on Youtube for demo.

See also

• SpeakTensor
• SparseProblems

This type of presentation is inspired by

• Universe Size Comparison | Cosmic Eye by Scientificus
• The Scale of the Universe by carykh

More recent works

• Metric Paper by CGP Grey
• You Are The Center of The Universe (Literally) by Kurzgesagt
• Search: video game maps size comparison
• Channel: Alex Evett