{"id":13305,"date":"2021-12-09T20:25:47","date_gmt":"2021-12-10T01:25:47","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=13305"},"modified":"2026-06-02T14:59:23","modified_gmt":"2026-06-02T18:59:23","slug":"tr-09-08-improved-methods-for-generating-quasi-gray-codes","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2009\/tr-09-08-improved-methods-for-generating-quasi-gray-codes\/","title":{"rendered":"TR-09-08: Improved Methods For Generating Quasi-Gray Codes"},"content":{"rendered":"\n
\n
\n\n
\n
\n
\n

\n TR-09-08: Improved Methods For Generating Quasi-Gray Codes\n <\/h1>\n \n \n <\/header>\n\n <\/div>\n\n <\/div>\n\n <\/div>\n<\/section>\n\n

Carleton University
\nTechnical Report<\/a> TR-09-08
\nOctober 16, 2009<\/p>\n\n\n\n

Improved Methods For Generating Quasi-Gray Codes<\/h2>\n\n\n\n
\n
\n
\n
\n
\n
\n
\n
\n

Dana Jansens<\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n

\n

Abstract<\/h3>\n

Consider a sequence of bit strings of length d, such that each string differs from the next in a constant number of bits, and the same holds for the first and last strings in the sequence. We call this sequence a cyclic quasi-Gray code. We examine the problem of efficiently generating such codes, by considering the number of bits read and written at each generating step, the average number of bits read while generating the entire code, and the number of strings generated in the code. Our results show a trade-off between these four constraints, and present algorithms which do less work on average than previous results, while also increasing the number of strings generated. Previous work has required at least one extra bit in the algorithms, such that at most 1\/2 of the possible bit strings are generated. Our results do not require an extra bit, and generate a factor of 1-O(d^{-t}), for a constant t, of the possible bit strings.<\/p>\n

TR-09-08.pdf<\/a><\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

Carleton University Technical Report TR-09-08 October 16, 2009 Improved Methods For Generating Quasi-Gray Codes Dana Jansens Abstract Consider a sequence of bit strings of length d, such that each string differs from the next in a constant number of bits, and the same holds for the first and last strings in the sequence. We call […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":12434,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[],"class_list":["post-13305","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":false},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/13305","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=13305"}],"version-history":[{"count":1,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/13305\/revisions"}],"predecessor-version":[{"id":13306,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/13305\/revisions\/13306"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12434"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=13305"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=13305"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}