On asymmetric error-correcting codes Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/6q182p41k

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Historically, coding theory has dealt with binary codes correcting symmetric errors, in which errors are made in both 0 and 1 bits with equal likelihood. Within the past ten years, some study has been made of asymmetric codes, under the assumption that the only errors which occur are errors in which 1 becomes 0. This thesis continues this study. We first examine systematic asymmetric codes, binary codes for which information and check portions are in distinct bit fields. This is a new area of study in coding theory. We establish that systematic asymmetric codes can have higher information rates than systematic symmetric codes, but not too much higher. We also give a construction for building systematic codes from smaller ones, with necessary and sufficient conditions for the codes so built to be systematic asymmetric codes. Finally, we examine Constantin-Rao codes and their extension to multiple asymmetric error correction. We show that such codes are not systematic and describe conditions under which they are closed under complements. We also show that the multiple asymmetric error correcting codes can have higher information rates than their symmetric counterparts.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using ScandAll PRO 1.8.1 on a Fi-6670 in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-08-27T16:34:57Z (GMT) No. of bitstreams: 1 CunninghamRobertS1982.pdf: 415372 bytes, checksum: fcc6ab290ad776b492458a8241c77348 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-08-21T17:38:33Z (GMT) No. of bitstreams: 1 CunninghamRobertS1982.pdf: 415372 bytes, checksum: fcc6ab290ad776b492458a8241c77348 (MD5)
  • description.provenance : Submitted by Katy Davis (kdscannerosu@gmail.com) on 2013-08-21T17:17:16Z No. of bitstreams: 1 CunninghamRobertS1982.pdf: 415372 bytes, checksum: fcc6ab290ad776b492458a8241c77348 (MD5)
  • description.provenance : Made available in DSpace on 2013-08-27T16:34:57Z (GMT). No. of bitstreams: 1 CunninghamRobertS1982.pdf: 415372 bytes, checksum: fcc6ab290ad776b492458a8241c77348 (MD5) Previous issue date: 1982-03-01

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items