Title :
Note on Circuits and Chains of Spread k in the n-Cube
Author_Institution :
Dep. Appl.Math Weizman Inst. Sci.
fDate :
4/1/1971 12:00:00 AM
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 :
Circuits, chains, codes.; Ash; Automata; Circuits and systems; Codes; Decoding; Error correction; Hamming distance; Information theory; Laboratories; Upper bound; Circuits, chains, codes.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/T-C.1971.223272
