Note on Circuits and Chains of Spread k in the n-Cube
- 1 April 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-20 (4) , 474
- https://doi.org/10.1109/t-c.1971.223272
Abstract
A known bound on the maximum size of a subset of the binary n-cube with distance k is applied to yield an asymptotically good bound on the length of a circuit or chain in the n-cube of spread k.Keywords
This publication has 0 references indexed in Scilit: