Gray codes and their applications Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/hd76s4515

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • An n-bit Gray code is an ordered set of all 2n binary strings of length n. The special property of this listing is that Hamming distance between consecutive vectors is exactly 1. If the last and first codeword also have a Hamming distance 1 then the code is said to be cyclic. This dissertation addresses problems dealing with the design and applications of new and existing types of both binary and non-binary Gray codes. It is shown how properties of certain Gray codes can be used to solve problems arising in different domains. New types of Gray codes to solve specific types of problems are also designed. We construct Gray codes over higher integral radices and show their applications. Applications of new classes of Gray codes defined over residue classes of Gaussian integers are also shown. We also propose new classes of binary Gray codes and prove some important properties of these codes.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Publisher
Language
File Format
File Extent
  • 803231 bytes
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2007-07-19T14:47:21Z (GMT). No. of bitstreams: 1 thesis.pdf: 803231 bytes, checksum: f14822c8df91440b53b6b8582275a156 (MD5)
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2007-07-11T17:15:04Z (GMT) No. of bitstreams: 1 thesis.pdf: 803231 bytes, checksum: f14822c8df91440b53b6b8582275a156 (MD5)
  • description.provenance : Submitted by Madhusudhanan Anantha Subramanian (anantham@onid.orst.edu) on 2007-06-19T19:20:51Z No. of bitstreams: 1 thesis.pdf: 803231 bytes, checksum: f14822c8df91440b53b6b8582275a156 (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items