Gray codes are perhaps the best known structures for listing sequences of combinatorial objects, such as binary strings. Simply defined as a minimal change listing, Gray codes vary greatly both in structure and in the types of objects that they list. More specific types of Gray codes are universal cycles and overlap sequences. Universal cycles are Gray codes on a set of strings of length n in which the first n-1 letters of one object are the same as the last n-1 letters of its predecessor in the listing. Overlap sequences allow this overlap to vary between 1 and n-1.
Download count: 0
- Partial requirement for: Ph.D., Arizona State University, 2012Note typethesis
- Includes bibliographical references (p. 181-185)Note typebibliography
- Field of study: Mathematics