TY - GEN
T1 - Mutually uncorrelated codes for DNA storage
AU - Levy, Maya
AU - Yaakobi, Eitan
N1 - Publisher Copyright: © 2017 IEEE.
PY - 2017/8/9
Y1 - 2017/8/9
N2 - Mutually Uncorrelated (MU) codes are a class of codes in which no proper prefix of one codeword is a suffix of another codeword. These codes were originally studied for synchronization purposes and recently, Yazdi et al. showed their applicability to enable random access in DNA storage. In this work we follow the research of Yazdi et al. and study MU codes along with their extensions to correct errors and balanced codes. We first review a well known construction of MU codes and study the asymptotic behavior of its cardinality. Then, we present an efficient algorithm for MU codes with linear encoding and decoding complexity. Next, we extend these results for (dh, dm)-MU codes that impose a minimum Hamming distance of dh between different codewords and dm between prefixes and suffixes. Particularly we show an efficient construction of these codes with nearly optimal redundancy and draw connections to the problem of comma-free and prefix synchronized codes. Lastly, we provide similar results for the edit distance and balanced MU codes.
AB - Mutually Uncorrelated (MU) codes are a class of codes in which no proper prefix of one codeword is a suffix of another codeword. These codes were originally studied for synchronization purposes and recently, Yazdi et al. showed their applicability to enable random access in DNA storage. In this work we follow the research of Yazdi et al. and study MU codes along with their extensions to correct errors and balanced codes. We first review a well known construction of MU codes and study the asymptotic behavior of its cardinality. Then, we present an efficient algorithm for MU codes with linear encoding and decoding complexity. Next, we extend these results for (dh, dm)-MU codes that impose a minimum Hamming distance of dh between different codewords and dm between prefixes and suffixes. Particularly we show an efficient construction of these codes with nearly optimal redundancy and draw connections to the problem of comma-free and prefix synchronized codes. Lastly, we provide similar results for the edit distance and balanced MU codes.
UR - http://www.scopus.com/inward/record.url?scp=85034047717&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2017.8007103
DO - 10.1109/ISIT.2017.8007103
M3 - منشور من مؤتمر
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 3115
EP - 3119
BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017
T2 - 2017 IEEE International Symposium on Information Theory, ISIT 2017
Y2 - 25 June 2017 through 30 June 2017
ER -