BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:How Much Information Can Be Stored Using Very Short DNA Molecules?
DTSTART:20260325T110000
DTEND:20260325T120000
DTSTAMP:20260502T223246Z
UID:5f0c1e4172f4adcb59fb95e8a699f785be2d63293f82e506333c5cb8
CATEGORIES:Conferences - Seminars
DESCRIPTION:Dr. Ran Tamir - Universitat Politècnica de Catalunya \nFrom 
 an information-theoretic point of view\, the commonly adopted DNA storage 
 channel\, the shuffling-sampling channel\, has two distinct operational re
 gimes. If the stored molecules are relatively long\, so that the number of
  molecule types is larger than the number of molecules that store the mess
 age\, the channel capacity is positive. Alternatively\, if the molecules a
 re relatively short and so that the number of molecule types is smaller th
 an the number of molecules that store the message\, then the resulting sto
 rage system is characterized by capacity zero. In this short molecule regi
 me\, Shomorony and Heckel (2022) put forward a conjecture on the scaling o
 f the number of information bits that can be reliably stored in the noisel
 ess case. This conjecture was only partially proved by Gerzon\, Weinberger
 \, and Shomorony (2025). In the first part of this talk\, I will describe 
 a random-coding scheme which completes the proof of the conjecture. Since 
 this random-coding scheme is computationally heavy\, the second part of th
 is talk is devoted to an alternative coding scheme which operates at a sig
 nificantly lower computational complexity but achieves the optimal scaling
 \, except for a specific range of very short molecules. In the final part 
 of this talk\, I will briefly discuss the noisy case and describe a concat
 enated coding scheme which combines linear block codes together with zero-
 undetected-error decoding.\n \n∗Based on a joint work with Nir Weinberg
 er and Albert Guillén i Fàbregas.\n\n\n\n 
LOCATION:BC 329 https://plan.epfl.ch/?room==BC%20329
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR