A Method for Constructing Circuit Codes

DOI10.1145/321406.321414MaRDI QIDQ5529021zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(10)

• Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube
• Snakes and pseudo-snakes in powers of complete graphs
• On the snake in the box problem
• Further results on snakes in powers of complete graphs
• On constructing snakes in powers of complete graphs
• On the asymptotic order of circuit codes
• Isomorphism of maximum length circuit codes
• 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\)
• Maximal length of circuit in a unitary \(n\)-dimensional cube

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5529021)