A Method for Constructing Circuit Codes

DOI10.1145/321406.321414zbMath0149.37401OpenAlexW2147896018MaRDI QIDQ5529021

Victor Klee

Publication date: 1967

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321406.321414

zbMATH Keywords

numerical analysis

Related Items (10)

Isomorphism of maximum length circuit codes ⋮ Snakes and pseudo-snakes in powers of complete graphs ⋮ On the snake in the box problem ⋮ On constructing snakes in powers of complete graphs ⋮ Further results on snakes in powers of complete graphs ⋮ On the asymptotic order of circuit codes ⋮ Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube ⋮ Maximal length of circuit in a unitary \(n\)-dimensional cube ⋮ The maximum length of circuit codes with long bit runs and a new characterization theorem ⋮ Snakes, coils, and single-track circuit codes with spread \(k\)

This page was built for publication: A Method for Constructing Circuit Codes