Asymmetric Lee distance codes: New bounds and constructions

Ryan Gabrys, Han Mao Kiah, Olgica Milenkovic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publication2015 IEEE Information Theory Workshop, ITW 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479955268
DOIs
StatePublished - Jun 24 2015
Event2015 IEEE Information Theory Workshop, ITW 2015 - Jerusalem, Israel
Duration: Apr 26 2015May 1 2015

Publication series

Name2015 IEEE Information Theory Workshop, ITW 2015

Other

Other2015 IEEE Information Theory Workshop, ITW 2015
CountryIsrael
CityJerusalem
Period4/26/155/1/15

Keywords

  • Coding for DNA-based storage
  • Coding theory

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Information Systems
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Asymmetric Lee distance codes: New bounds and constructions'. Together they form a unique fingerprint.

  • Cite this

    Gabrys, R., Kiah, H. M., & Milenkovic, O. (2015). Asymmetric Lee distance codes: New bounds and constructions. In 2015 IEEE Information Theory Workshop, ITW 2015 [7133171] (2015 IEEE Information Theory Workshop, ITW 2015). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2015.7133171