1. Chase, P.J.: Combination generation and graylex ordering. Congressus Numerantium 69, 215–242 (1989)
2. Deng, D., Stinson, D.R., Li, P.C., van Rees, G.H.J., Wei, R.: Constructions and bounds for splitting systems. Submitted
3. Eades, P., McKay, B.: An algorithm for generating subsets of fixed size with a strong minimal change property. Information Processing Letters 19, 131–133 (1984)
4. Heiman, R.: A note on discrete logarithms with special structure. Lecture Notes in Computer Science 658, 454–457 (1993) (Advances in Cryptology – EUROCRYPT '92)
5. Jenkyns, T.A., McCarthy, D.: Generating all k-subsets of {1, . . . , n} with minimal changes. Ars Combinatoria 40, 153–159 (1995)