On the Asymptotic Order of Circuit Codes

Kevin M. Byrnes, Florin Spinu

In this note we prove that the maximum length of a $d$-dimensional circuit code of spread $k$ equals $2^{d+O_k({\log }^{2}d)}$, with the implied constant depending only on $k$.