Re: local bit flip Gray codes
- To: "Eugene Leitl" <Eugene.Leitl@xxxxxxxxxxxxxxxxxxx>, <fork@xxxxxxxx>
- Subject: Re: local bit flip Gray codes
- From: <eugene.leitl@xxxxxxxxxxxxxxxxxxx>
- Date: Mon, 12 Jun 2000 17:09:10 -0700
- References: <14661.24510.116531.922865@lrz.uni-muenchen.de>
- Resent-Date: Mon, 12 Jun 2000 16:31:16 -0700 (PDT)
- Resent-From: Eugene Leitl <eugene.leitl@xxxxxxxxxxxxxxxxxxx>
- Resent-Message-ID: <14661.29380.407980.347086@lrz.uni-muenchen.de>
- Resent-To: <transhumantech@xxxxxxxxxxxxx>, <transhumantech@xxxxxxxxxxx>, <MISC>
From: "Chris Olds" <cco@dydax.com>
I've recently found ResearchIndex (formerly citeseer) , which is a great
metasite for CS papers <http://citeseer.nj.nec.com/cs>. One paper that looks
promising is <http://citeseer.nj.nec.com/savage96survey.html>
<Abstract>
The term combinatorial Gray code was introduced in 1980 to refer
to any method for generating combinatorial objects so that successive
objects differ in some pre-specified, small way. This notion
generalizes the classical binary reflected Gray code scheme for
listing n-bit binary numbers so that successive numbers differ in
exactly one bit position, as well as work in the 1960's and 70's on
minimal change listings for other combinatorial families, including
permutations and combinations.
</Abstract>
Most of the citations are apparently only available in dead tree form, but
it's a start...
/cco
--
<pipe>Ceci n'est pas une pipe</pipe>
