Asymmetric Lee Distance Codes for DNA-Based Storage

DOI10.1109/TIT.2017.2700847MaRDI QIDQ5369848zbMATH OpenFDO

Authors Ryan Gabrys, Han Mao Kiah, Olgica Milenkovic

Publication date 19 October 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.00740

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Linear codes (general theory) (94B05)

Abstract: We consider a new family of codes, termed asymmetric Lee distance codes, that arise in the design and implementation of DNA-based storage systems and systems with parallel string transmission protocols. The codewords are defined over a quaternary alphabet, although the results carry over to other alphabet sizes; furthermore, symbol confusability is dictated by their underlying binary representation. Our contributions are two-fold. First, we demonstrate that the new distance represents a linear combination of the Lee and Hamming distance and derive upper bounds on the size of the codes under this metric based on linear programming techniques. Second, we propose a number of code constructions which imply lower bounds.

Cited in

(6)

• Rank-Modulation Codes for DNA Storage With Shotgun Sequencing
• Improved Rank-Modulation Codes for DNA Storage With Shotgun Sequencing
• Set-codes with small intersections and small discrepancies
• Sequence-Subset Distance and Coding for Error Control in DNA-Based Data Storage
• Maximum distance separable repeated-root constacyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) with respect to the Lee distance
• Binary stretch embedding of weighted graphs

This page was built for publication: Asymmetric Lee Distance Codes for DNA-Based Storage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5369848)