| dc.contributor | Bella, Bose | |
| dc.contributor | Flahive, Mary | |
| dc.contributor | Lee, Ben | |
| dc.contributor | Nguyen, Thinh | |
| dc.date | 2007-07-19T14:47:21Z | |
| dc.date | 2007-07-19T14:47:21Z | |
| dc.date | 2007-06-01 | |
| dc.date | 2007-07-19T14:47:21Z | |
| dc.date.accessioned | 2013-10-16T07:53:39Z | |
| dc.date.available | 2013-10-16T07:53:39Z | |
| dc.date.issued | 2013-10-16 | |
| dc.identifier | http://hdl.handle.net/1957/6123 | |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1957/6123 | |
| dc.description | Graduation date: 2008 | |
| dc.description | 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. | |
| dc.language | en_US | |
| dc.subject | Gray Codes | |
| dc.subject | Hamiltonian Cycles | |
| dc.subject | ARQ Protocols | |
| dc.subject | Unidirectional Codes | |
| dc.subject | Coding Theory | |
| dc.subject | Mathematics | |
| dc.subject | Computer Science | |
| dc.title | Gray codes and their applications | |
| dc.type | Thesis |
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||