Donald T. Tang, Chin-Long Chen
IEEE TC
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.
Donald T. Tang, Chin-Long Chen
IEEE TC
Zeev Barzilai, Leendert M. Huisman, et al.
IEEE Design and Test of Computers
Jin Fuw Lee, Donald T. Tang, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hisashi Kobayashi, Donald T. Tang
IEEE Transactions on Communication Technology