Restricted Composition Deletion Correcting Codes

Daniel Cullina, Negar Kiyavash, Ankur A. Kulkarni

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

We investigate deletion correcting codes and restricted composition codes in particular. Restricted composition codes generalize codes on permutations and multipermutations. We use graph theoretic methods to characterize codes, establish bounds on code size, and describe constructions. The substring partial order has a well-known property. For any string, the number of superstrings of a particular length depends only on the length of the original string. We generalize this property to take compositions into account. For any string, the number of superstrings of a particular composition depends only on the composition of the original string. We present a bijective proof of this fact. We apply this result to obtain a lower bound on the size of restricted composition codes. We obtain an upper bound by analyzing deletion errors when the composition of deleted symbols is restricted to a particular worst case composition. We construct binary restricted composition single-deletion correcting codes and show that they are asymptotically optimal and form an optimal coloring. There is a natural distance on compositions that provides a lower bound on deletion distance. Unrestricted deletion correcting codes can be constructed from the union of restricted composition codes as long as the set of compositions used themselves form a code. The nonbinary single-deletion correcting codes constructed by Tenengolts are a special case of our method.

Original languageEnglish (US)
Article number7437482
Pages (from-to)4819-4832
Number of pages14
JournalIEEE Transactions on Information Theory
Volume62
Issue number9
DOIs
StatePublished - Sep 1 2016

Fingerprint

Chemical analysis
symbol
Coloring

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Cullina, Daniel ; Kiyavash, Negar ; Kulkarni, Ankur A. / Restricted Composition Deletion Correcting Codes. In: IEEE Transactions on Information Theory. 2016 ; Vol. 62, No. 9. pp. 4819-4832.
@article{731fc04c9ade41fca6f83b0c1e2fb266,
title = "Restricted Composition Deletion Correcting Codes",
abstract = "We investigate deletion correcting codes and restricted composition codes in particular. Restricted composition codes generalize codes on permutations and multipermutations. We use graph theoretic methods to characterize codes, establish bounds on code size, and describe constructions. The substring partial order has a well-known property. For any string, the number of superstrings of a particular length depends only on the length of the original string. We generalize this property to take compositions into account. For any string, the number of superstrings of a particular composition depends only on the composition of the original string. We present a bijective proof of this fact. We apply this result to obtain a lower bound on the size of restricted composition codes. We obtain an upper bound by analyzing deletion errors when the composition of deleted symbols is restricted to a particular worst case composition. We construct binary restricted composition single-deletion correcting codes and show that they are asymptotically optimal and form an optimal coloring. There is a natural distance on compositions that provides a lower bound on deletion distance. Unrestricted deletion correcting codes can be constructed from the union of restricted composition codes as long as the set of compositions used themselves form a code. The nonbinary single-deletion correcting codes constructed by Tenengolts are a special case of our method.",
author = "Daniel Cullina and Negar Kiyavash and Kulkarni, {Ankur A.}",
year = "2016",
month = "9",
day = "1",
doi = "10.1109/TIT.2016.2544348",
language = "English (US)",
volume = "62",
pages = "4819--4832",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

Restricted Composition Deletion Correcting Codes. / Cullina, Daniel; Kiyavash, Negar; Kulkarni, Ankur A.

In: IEEE Transactions on Information Theory, Vol. 62, No. 9, 7437482, 01.09.2016, p. 4819-4832.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Restricted Composition Deletion Correcting Codes

AU - Cullina, Daniel

AU - Kiyavash, Negar

AU - Kulkarni, Ankur A.

PY - 2016/9/1

Y1 - 2016/9/1

N2 - We investigate deletion correcting codes and restricted composition codes in particular. Restricted composition codes generalize codes on permutations and multipermutations. We use graph theoretic methods to characterize codes, establish bounds on code size, and describe constructions. The substring partial order has a well-known property. For any string, the number of superstrings of a particular length depends only on the length of the original string. We generalize this property to take compositions into account. For any string, the number of superstrings of a particular composition depends only on the composition of the original string. We present a bijective proof of this fact. We apply this result to obtain a lower bound on the size of restricted composition codes. We obtain an upper bound by analyzing deletion errors when the composition of deleted symbols is restricted to a particular worst case composition. We construct binary restricted composition single-deletion correcting codes and show that they are asymptotically optimal and form an optimal coloring. There is a natural distance on compositions that provides a lower bound on deletion distance. Unrestricted deletion correcting codes can be constructed from the union of restricted composition codes as long as the set of compositions used themselves form a code. The nonbinary single-deletion correcting codes constructed by Tenengolts are a special case of our method.

AB - We investigate deletion correcting codes and restricted composition codes in particular. Restricted composition codes generalize codes on permutations and multipermutations. We use graph theoretic methods to characterize codes, establish bounds on code size, and describe constructions. The substring partial order has a well-known property. For any string, the number of superstrings of a particular length depends only on the length of the original string. We generalize this property to take compositions into account. For any string, the number of superstrings of a particular composition depends only on the composition of the original string. We present a bijective proof of this fact. We apply this result to obtain a lower bound on the size of restricted composition codes. We obtain an upper bound by analyzing deletion errors when the composition of deleted symbols is restricted to a particular worst case composition. We construct binary restricted composition single-deletion correcting codes and show that they are asymptotically optimal and form an optimal coloring. There is a natural distance on compositions that provides a lower bound on deletion distance. Unrestricted deletion correcting codes can be constructed from the union of restricted composition codes as long as the set of compositions used themselves form a code. The nonbinary single-deletion correcting codes constructed by Tenengolts are a special case of our method.

UR - http://www.scopus.com/inward/record.url?scp=84983556566&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84983556566&partnerID=8YFLogxK

U2 - 10.1109/TIT.2016.2544348

DO - 10.1109/TIT.2016.2544348

M3 - Article

AN - SCOPUS:84983556566

VL - 62

SP - 4819

EP - 4832

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 9

M1 - 7437482

ER -