Withdraw
Loading…
Constant composition deletion correcting codes
Cullina, Daniel
Loading…
Permalink
https://hdl.handle.net/2142/72914
Description
- Title
- Constant composition deletion correcting codes
- Author(s)
- Cullina, Daniel
- Issue Date
- 2015-01-21
- Director of Research (if dissertation) or Advisor (if thesis)
- Kiyavash, Negar
- Department of Study
- Electrical & Computer Eng
- Discipline
- Electrical & Computer Engr
- Degree Granting Institution
- University of Illinois at Urbana-Champaign
- Degree Name
- M.S.
- Degree Level
- Thesis
- Keyword(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.
- Graduation Semester
- 2014-12
- Permalink
- http://hdl.handle.net/2142/72914
- Copyright and License Information
- Copyright 2014 Daniel Cullina
Owning Collections
Graduate Dissertations and Theses at Illinois PRIMARY
Graduate Theses and Dissertations at IllinoisDissertations and Theses - Electrical and Computer Engineering
Dissertations and Theses in Electrical and Computer EngineeringManage Files
Loading…
Edit Collection Membership
Loading…
Edit Metadata
Loading…
Edit Properties
Loading…
Embargoes
Loading…