{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:26:55Z","timestamp":1649039215872},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2014,12]]},"abstract":"<jats:p> 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. <\/jats:p>","DOI":"10.1142\/s1793830914500621","type":"journal-article","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T10:24:39Z","timestamp":1408530279000},"page":"1450062","source":"Crossref","is-referenced-by-count":0,"title":["Gray codes and overlap cycles for restricted weight words"],"prefix":"10.1142","volume":"06","author":[{"given":"Victoria","family":"Horan","sequence":"first","affiliation":[{"name":"Air Force Research Laboratory, Information Directorate, New York, USA"}]},{"given":"Glenn","family":"Hurlbert","sequence":"additional","affiliation":[{"name":"School of Mathematical and Statistical Sciences, Arizona State University, Arizona, USA"}]}],"member":"219","published-online":{"date-parts":[[2014,10,10]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.5009360"},{"key":"rf2","first-page":"161","volume":"204","author":"Godbole A.","year":"2010","journal-title":"Congr. Numer."},{"key":"rf4","first-page":"#A29","volume":"14","author":"Horan V.","year":"2014","journal-title":"Integers"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1094886"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(95)90091-8"},{"key":"rf8","first-page":"323","volume":"33","author":"Walsh T. R.","year":"2000","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"rf9","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2001"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830914500621","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:47:16Z","timestamp":1565095636000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830914500621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,10]]},"references-count":7,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2014,10,10]]},"published-print":{"date-parts":[[2014,12]]}},"alternative-id":["10.1142\/S1793830914500621"],"URL":"https:\/\/doi.org\/10.1142\/s1793830914500621","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,10]]}}}