Thumbnail
Access Restriction
Subscribed

Author Klee, Victor
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1967
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract A $\textit{d}-dimensional$ circuit code of spread $\textit{s}$ (also called $\textit{SIBs},$ code or circuit code of minimum distance $\textit{s})$ is a simple circuit $\textit{Q}$ in the graph of the $\textit{d}-dimensional$ cube [0, $1]\textit{d}$ such that any two vertices of $\textit{Q}$ differing in exactly $\textit{r}$ coordinates, with $\textit{r}$ < $\textit{s},$ can be joined by a path formed from $\textit{r}$ edges of $\textit{Q}.$ Such codes are designed to introduce error detection into certain analog-to-digital conversion systems. Longer codes correspond to increased accuracy of the system, and hence there is interest in determining the maximum length $\textit{C}(\textit{d},$ $\textit{s})$ of $\textit{d}-dimensional$ circuit codes of spread $\textit{s}.$ In the present study the author contributes to this problem for even values of $\textit{s}$ by describing a method of combining a code of spread $\textit{s}$ with a suitably related code of spread $\textit{s}-1$ so as to produce a longer code of spread $\textit{s}.$
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1967-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 14
Issue Number 3
Page Count 9
Starting Page 520
Ending Page 528


Open content in new tab

   Open content in new tab
Source: ACM Digital Library