Lee Distance and Topological Properties of k-ary n-cubes

• Authors: Bob Broeg;Bella Bose;Younggeun Kwon;Yaagoub Ashir
• Venue: IEEE Transactions on Computers
• Year: 1995

In this paper, we consider various topological properties of a k-ary n-cube $(Q^k_n)$ using Lee distance. We feel that Lee distance is a natural metric for defining and studying a $Q^k_n$.After defining a $Q^k_n$ graph using Lee distance, we show how to find all disjoint paths between any two nodes. Given a sequence of radix k numbers, a function mapping the sequence to a Gray code sequence is presented, and this function is used to generate a Hamiltonian cycle.Embedding the graph of a mesh and the graph of a binary hypercube into the graph of a $Q^k_n$ is considered. Using a k-ary Gray code, we show the embedding of a $k^{n_1}\times k^{n_2}\times \,\,\ldots \,\,\times k^{n_m}-$ dimensional mesh into a $Q^k_n$ where $n\,\,=\,\,\sum\nolimits_{i=1}^m {n_i}$. Then using a single digit, 4-ary reflective Gray code, we demonstrate embedding a Qn into a $Q^4_{\lceil {n\over 2}\rceil}$.We look at how Lee distance may be applied to the problem of resource placement in a $Q^k_n$ by using a Lee distance error-correcting code. Although the results in this paper are only preliminary, Lee distance error-correcting codes have not been applied previously to this problem.Finally, we consider how Lee distance can be applied to message routing and single-node broadcasting in a $Q^k_n$. In this section we present two single-node broadcasting algorithms that are optimal when single-port and multi-port I/O is used.