Abstract
Ad-dimensional circuit code of spreads is a simple circuitC in the graph of thed-dimen sional unit cube with the property that for any verticesx andy ofC which differ in exactlyr co-ordinates,r<s, there exists a path fromx toy consisting ofr edges ofC. This property is useful for detecting and limiting errors. In this paper we give a new upper bound for the maximum length of ad-dimensional circuit code of spread 2.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. L. Abbott, A Note on the Snake-in-the-Box Problem, unpublished manuscript.Some Problems in Combinatorial Analysis, Ph. D. thesis, University of Alberta, Edmonton, Canada, 1965.
L. Danzer andV. Klee, Length of Snakes in Boxes,J. Combinatorial Theory 2 (1967), 258–265.
R. J. Douglas, Upper Bounds on the Length of Circuits of Even Spread in thed-Cube,J. Combinatorial Theory 7 (1969), 206–214.
V. V. Glagolev, An Upper Estimate of the Length of a Cycle in then-Dimensional Unit Cube (Russian),Diskretnyi Analiz 6 (1966), 3–7.
W. H. Kautz, Unit-Distance Error-Checking Codes,IRE Trans. Electronic Computers 3 (1958), 179–180.
V. Klee, The Use of Circuit Codes in Analog-to-Digital Conversion,Graph Theory and its Applications (ed. B. Harris), Academic Press, New York, 1970, 121–132.
D. G. Larman,Circuit Codes, unpublished, quoted from Douglas [3].
R. C. Singleton, Generalized Snake-in-the-Box Codes,IEEE Trans. Electronic Computers EC-15 (1966), 596–602.