Lee distance, Gray codes, and the torus

The torus is a topology that is the basis for the communication network of several multicomputers in use today. This paper briefly explores several to pological characteristics of a generalized torus network using concepts fro m Coding theory and Graph theory. From Coding theory, the Lee distance metr ic and Gray codes are extended to mixed radix numbers. Lee distance is used to state the number and length of disjoint paths between two nodes in a to rus. In addition, a function mapping a sequence of mixed radix numbers to a mixed radix Gray code sequence is described; and, provided at least one ra dix is even, this sequence is used to embed in the torus a cycle of any eve n length, including a Hamiltonian cycle. The torus is defined both as a cro ss product of cycles and using Lee distance. The graph-theoretic definition of a torus leads to a simple single node broadcasting algorithm, which is described in the last section.