Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1957/6123
Full metadata record
DC FieldValueLanguage
dc.contributorBella, Bose-
dc.contributorFlahive, Mary-
dc.contributorLee, Ben-
dc.contributorNguyen, Thinh-
dc.date2007-07-19T14:47:21Z-
dc.date2007-07-19T14:47:21Z-
dc.date2007-06-01-
dc.date2007-07-19T14:47:21Z-
dc.date.accessioned2013-10-16T07:53:39Z-
dc.date.available2013-10-16T07:53:39Z-
dc.date.issued2013-10-16-
dc.identifierhttp://hdl.handle.net/1957/6123-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1957/6123-
dc.descriptionGraduation date: 2008-
dc.descriptionAn 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.-
dc.languageen_US-
dc.subjectGray Codes-
dc.subjectHamiltonian Cycles-
dc.subjectARQ Protocols-
dc.subjectUnidirectional Codes-
dc.subjectCoding Theory-
dc.subjectMathematics-
dc.subjectComputer Science-
dc.titleGray codes and their applications-
dc.typeThesis-
Appears in Collections:ScholarsArchive@OSU

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.