Distance-2 Cyclic Chaining of Constant-Weight Codes

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. Copyright © 1973 by The Institute of Electrical and Electronics Engineers, Inc.