Asymmetric Lee distance codes for DNA-based storage

IEEE International Symposium on Information Theory - Proceedings

Volumn 2015-June, Issue , 2015, Pages 909-913

  Gabrys, Ryan ^a,b   Kiah, Han Mao ^c   Milenkovic, Olgica ^a  

^a University of Illinois at Urbana Champaign   (United States)

^b Naval Command   (United States)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Coding for DNA based storage; Coding theory

Indexed keywords

CODES (SYMBOLS); COMPUTER PROGRAMMING; DNA; INFORMATION THEORY; LINEAR PROGRAMMING;

BINARY REPRESENTATIONS; CODE CONSTRUCTION; CODING THEORY; DESIGN AND IMPLEMENTATIONS; DISTANCE MEASURE; LINEAR PROGRAMMING TECHNIQUES; STORAGE SYSTEMS; TRANSMISSION PROTOCOLS;

GENE ENCODING;

EID: 84969781322     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2015.7282587     Document Type: Conference Paper

References (16)

1. T. Alderson and S. Huntemann. "On maximum Lee distance codes, " J. of Discrete Mathematics, 2013.
2. J. Astola, "The theory of Lee-codes, " Lappeenranta University of Technology, Department of Physics and Mathematics, Research Report, Jan. 1982.
3. G. M. Church, Y. Gao, and S. Kosuri, "Next-generation digital information storage in DNA, " Science, vol. 337, no. 6102, pp. 1628-1628, Sep. 2012.
4. A. Fazeli, A. Vardy, E. Yaakobi, "Generalized Sphere Packing Bound, " available at http://arxiv. org/abs/1401. 6496, 2014.
5. R. Feynman, "There's plenty of room at the bottom, " Caltech, Pasadena. 29 Dec. 1959. Lecture.
6. N. Goldman et al., "Towards practical, high-capacity, low-maintenance information storage in synthesized DNA, " Nature, Jan. 2013.
7. E. Hof et al., "Capacity-achieving polar codes for arbitrarily permuted parallel channels, " IEEE Trans. on Info. Theory, vol. 59, no. 3, pp. 1505-1516, March 2013.
8. K. A. S. Immink, Codes for mass data storage systems, Shannon Foundation Publisher, 2004.
9. M. Kaykobad, "Positive solutions of positive linear systems, " Lin. Alg. And its App., vol. 64, pp. 133-140, Jan. 1985.
10. A. A. Kulkarni, and N. Kiyavash, "Nonasymptotic upper bounds for deletion correcting codes, " IEEE Trans. on Info. Theory, vol. 59, no. 8, pp. 5115-5130, April 2013.
11. A. Mazumdar, A. Barg, and N. Kashyap, "Coding for high-density recording on a 1-D granular magnetic medium, " IEEE Trans. on Info. Theory, vol. 57, no. 11, pp. 7403-7417, June 2011.
12. O. Milenkovic and N. Kashyap, "On the design of codes for DNA computing, " Coding and Cryptography, Springer Berlin Heidelberg, pp. 100-119, 2006.
13. K. Nakamura, et al., "Sequence-specific error profile of Illumina sequencers, " Nucleic acids research, voll. 39, no. 13, 2011.
14. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding, " IEEE Trans. on Info. Theory, vol. 47, no. 2, pp. 599-618, August 2002.
15. Roth, R., Introduction to coding theory, Cambridge University Press, 2006.
16. Tal, I., Vardy, A., "How to construct polar codes, " IEEE Trans. on Info. Theory, vol. 59, no. 10, pp. 6562-6582, September 2013.