2014/03/07 by Victoria Horan, Horan, Victoria, Glenn Hurlbert +1
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #05A05 (primary) 68R15 #68W32 (secondary) #Algorithms and Data Compression #Combinatorics (math.CO) #DNA and Biological Computing #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.DM #cs.IT #math.CO #math.IT #msc:05A05 #msc:68R15 #msc:68W32 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1403.1818
13 pages, 2 figures
arxiv created 2014/03/07 · openalex publication_date 2014/03/07 · arxiv updated 2014/03/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A Gray code is a listing structure for a set of combinatorial objects such that some consistent (usually minimal) change property is maintained throughout adjacent elements in the list. While Gray codes for m-ary strings have been considered in the past, we provide a new, simple Gray code for fixed-weight m-ary strings. In addition, we consider a relatively new type of Gray code known as overlap cycles and prove basic existence results concerning overlap cycles for fixed-weight and weight-range m-ary words.