Asymmetric Lee distance codes: New bounds and constructions

Author

Gabrys, Ryan ; Han Mao Kiah ; Milenkovic, Olgica

Author_Institution

Coordinated Sci. Lab., Univ. of Illinois, Urbana, IL, USA

fYear

2015

fDate

April 26 2015-May 1 2015

Firstpage

1

Lastpage

5

Abstract

We continue our study of a new family of asymmetric Lee codes that arise in the design and implementation of emerging DNA-based storage systems and systems which use parallel string transmission protocols. The codewords are defined over a quaternary alphabet, although the results carry over to other alphabet sizes, and have symbol distances dictated by their underlying binary representation. Our contributions include deriving new bounds for the size of the largest code in this metric based on Delsarte-like linear programming methods and describing new constructions for non-linear asymmetric Lee codes.

Keywords

binary codes; nonlinear codes; protocols; DNA-based storage systems; Delsarte-like linear programming methods; alphabet sizes; binary representation; codewords; nonlinear asymmetric Lee distance codes; parallel string transmission protocols; quaternary alphabet; symbol distances; DNA; Encoding; Linear programming; Measurement; Sequential analysis; Switches; Zinc; Coding for DNA-based storage; Coding theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Workshop (ITW), 2015 IEEE

Conference_Location

Jerusalem

Print_ISBN

978-1-4799-5524-4

Type

conf

DOI

10.1109/ITW.2015.7133171

Filename

7133171