Files in this item

FilesDescriptionFormat

application/pdf

application/pdfDaniel_Cullina.pdf (365kB)
(no description provided)PDF

Description

Title:Constant composition deletion correcting codes
Author(s):Cullina, Daniel
Advisor(s):Kiyavash, Negar
Department / Program:Electrical & Computer Eng
Discipline:Electrical & Computer Engr
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:M.S.
Genre:Thesis
Subject(s):coding theory
error correction
deletion channel
combinatorics
Abstract:We investigate deletion correcting codes and constant composition codes in particular. We use graph theoretic methods to characterize codes, establish bounds on code size, and describe constructions. The substring partial order has a suprising 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 constant composition codes. We use a different technique to prove an upper bound. We construct binary constant 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 constant composition codes as long as the set of compositions used themselves form a code. The nonbinary single deletion codes constructed by Tenengolts are a special case of this method. We show that there is a qualitative difference between the problem of correcting a single deletion and the problem of correcting multiple deletions. In the single deletion case, the Varshamov Tenengolts codes are an optimal coloring of the confusion graph and each individual color class is asymptotically optimal. By constructing large cliques in the multiple deletion confusion graphs, we show that no construction can have both of the properties.
Issue Date:2015-01-21
URI:http://hdl.handle.net/2142/72914
Rights Information:Copyright 2014 Daniel Cullina
Date Available in IDEALS:2015-01-21
Date Deposited:2014-12


This item appears in the following Collection(s)

Item Statistics