Abstract
Certain problems in coding and in switching theory require a list of distinct binary n-tuples such that each differs from the one preceding it in just one coordinate. Geometrically, such a list corresponds to a path which follows edges of an n-dimensional cube. This paper finds all types of closed paths on cubes with n ≦ 4. For larger n, a process given here will produce large numbers of paths.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
