ee = {http://arxiv.org/abs/1112.5239}
}
+
+
+@article{DBLP:journals/combinatorics/BhatS96,
+ author = {Girish S. Bhat and
+ Carla D. Savage},
+ title = {Balanced Gray Codes},
+ journal = {Electr. J. Comb.},
+ volume = {3},
+ number = {1},
+ year = {1996},
+ url = {http://www.combinatorics.org/Volume_3/Abstracts/v3i1r25.html},
+ timestamp = {Tue, 05 Oct 2004 14:51:02 +0200},
+ biburl = {http://dblp.uni-trier.de/rec/bib/journals/combinatorics/BhatS96},
+ bibsource = {dblp computer science bibliography, http://dblp.org}
+}
+
+
+@Article{Bykov2016,
+author="Bykov, I. S.",
+title="On locally balanced gray codes",
+journal="Journal of Applied and Industrial Mathematics",
+year="2016",
+volume="10",
+number="1",
+pages="78--85",
+abstract="We consider locally balanced Gray codes.We say that a Gray code is locally balanced if every ``short'' subword in its transition sequence contains all letters of the alphabet |1, 2,..., n{\textasciitilde}. The minimal length of these subwords is the window width of the code. We show that for each n ≥ 3 there exists a Gray code with window width at most n + 3⌊log n⌋.",
+issn="1990-4797",
+doi="10.1134/S1990478916010099",
+url="http://dx.doi.org/10.1134/S1990478916010099"
+}
+
+
+@article{Robinson:1981:CS,
+ author = {Robinson, John P. and Cohn, Martin},
+ title = {Counting Sequences},
+ journal = {IEEE Trans. Comput.},
+ issue_date = {January 1981},
+ volume = {30},
+ number = {1},
+ month = jan,
+ year = {1981},
+ issn = {0018-9340},
+ pages = {17--23},
+ numpages = {7},
+ url = {http://dl.acm.org/citation.cfm?id=1963620.1963622},
+ acmid = {1963622},
+ publisher = {IEEE Computer Society},
+ address = {Washington, DC, USA},
+ keywords = {circuit testing, counters, gray codes, hamming distance, transition counts, uniform distance},
+}
+
