1

Phillip J. Chase, Algorithm 382: combinations of M out of N objects [G6], Communications of the ACM, v.13 n.6, p.368, June 1970  [doi>10.1145/362384.362502]

2

Tang, D.T., and Liu, C.N. On enumerating m out of n combinations with minimal replacements. Proc. of Fifth Ann. Princeton Conf. on Info. Sci. and Sys., Mar. 1971.

3

Tang, D.T., and Liu, C.N. Distance-Two Cyclic Chaining of Constant-Weight Codes. IEEETC. C-22, 2 (Feb. 1973), 176-180.

Selim G. Akl, A Comparison of Combination Generation Methods, ACM Transactions on Mathematical Software (TOMS), v.7 n.1, p.42-45, March 1981

W. H. Payne , K. L. McMillen, Orderly enumeration of nonsingular binary matrices applied to text encryption, Communications of the ACM, v.21 n.4, p.259-263, April 1978

B. P. Buckles , M. Lybanon, Algorithm 515: Generation of a Vector from the Lexicographical Index [G6], ACM Transactions on Mathematical Software (TOMS), v.3 n.2, p.180-182, June 1977

James R. Bitner , Gideon Ehrlich , Edward M. Reingold, Efficient generation of the binary reflected gray code and its applications, Communications of the ACM, v.19 n.9, p.517-521, Sept. 1976

Simeon C. Ntafos, An evaluation of required element testing strategies, Proceedings of the 7th international conference on Software engineering, p.250-256, March 26-29, 1984, Orlando, Florida, United States

W. H. Payne , F. M. Ives, Combination Generators, ACM Transactions on Mathematical Software (TOMS), v.5 n.2, p.163-172, June 1979

Vincent Vajnovszki , Timothy Walsh, A loop-free two-close Gray-code algorithm for listing k-ary Dyck words, Journal of Discrete Algorithms, v.4 n.4, p.633-648, December, 2006

C. N. Liu: colleagues

D. T. Tang: colleagues