DocumentCode
1112427
Title
Distance-2 Cyclic Chaining of Constant-Weight Codes
Author
Tang, Donald T. ; Liu, C.N.
Author_Institution
IBM T. J. Watson Research Center
Issue
2
fYear
1973
Firstpage
176
Lastpage
180
Abstract
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.
Keywords
Constant-weight codes, enumeration of m-out-of-n combinations, Gray codes, Hamiltonian circuits.; Analog-digital conversion; Binary codes; Circuits; Information retrieval; Protection; Reflective binary codes; Constant-weight codes, enumeration of m-out-of-n combinations, Gray codes, Hamiltonian circuits.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1973.223681
Filename
1672274
Link To Document