Mutually Uncorrelated Codes for DNA Storage
Abstract: Mutually Uncorrelated (MU) codes are a class of codes in which no proper prefix of one codeword is a suffix of another codeword. In this work, we review a well-known construction of MU codes and study the asymptotic behavior of its cardinality. We then present an efficient implementation and expand this study to (d_h,d_m)-MU codes that impose a minimum distance of d_h between codewords and d_m between prefixes and suffixes. We also provide similar results for edit distance and balanced MU codes.
Bio: Maya Levy received a B.Sc. in Computer Engineering from the Technion, Israel in 2014. From 2011 to 2014 she worked in Intel as a student in GPU architecture team and in computer vision middleware team. She is currently pursuing an M.Sc. degree in Computer Science in the Technion. Her research interests are algorithms and coding for DNA-based storage.