Gray Codes and Overlap Cycles for Restricted Weight Words
Combinatorics
2014-03-10 v1 Discrete Mathematics
Information Theory
math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.1403.1818,
title = {Gray Codes and Overlap Cycles for Restricted Weight Words},
author = {Victoria Horan and Glenn Hurlbert},
journal= {arXiv preprint arXiv:1403.1818},
year = {2014}
}
Comments
13 pages, 2 figures