Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups
I Levi, S Seif - Journal of Algebra, 2003 - Elsevier
Let τ be a partition of the positive integer n. A partition of the set Xn={1, 2,…, n} is said to be
of type τ if the sizes of its classes form the partition τ of n. Given 1< r< n, an r element subset …
of type τ if the sizes of its classes form the partition τ of n. Given 1< r< n, an r element subset …
Algorithms for labeling constant weight Gray codes
I Levi, RB McFADDEN, S Seif - Glasgow Mathematical Journal, 2005 - cambridge.org
ALGORITHMS FOR LABELING CONSTANT WEIGHT GRAY CODES Page 1 Glasgow Math.
J. 47 (2005) 221–236. C 2005 Glasgow Mathematical Journal Trust. doi:10.1017/S0017089505002430 …
J. 47 (2005) 221–236. C 2005 Glasgow Mathematical Journal Trust. doi:10.1017/S0017089505002430 …