Issue No.02 - February (1973 vol.22)
D.T. Tang , IBM T. J. Watson Research Center
The cyclic distance-2 chaining of constant-weight codes has applications in A/ D conversions as well as in combinatorial problems involving the exhaustion of m-out-of-n combinations. It is shown in this paper that such a chaining can be obtained from the Gray code circuit and its transformations. Algorithms based on several theorems derived have been developed and programmed in APL.
Constant-weight codes, enumeration of m-out-of-n combinations, Gray codes, Hamiltonian circuits.
D.T. Tang, "Distance-2 Cyclic Chaining of Constant-Weight Codes", IEEE Transactions on Computers, vol.22, no. 2, pp. 176-180, February 1973, doi:10.1109/T-C.1973.223681