This Java applet generates k-suffixes, that is,
length (n+m) binary strings with n
0's and m 1's where each binary string has
the suffix property : any suffix has at least k-1
times as many 0's as 1's. (And so n>=m(k-1).)
The generating order is a 2-close Gray code order:
two successive strings in the list differ by the transposition of a 1 and a 0
which are either adjacent or separated by a single 0.
Generally, a more restrictive list for k-suffixes
does not exist.