Data compression and Gray-code sorting
Information Processing Letters
Gray Codes for Partial Match and Range Queries
IEEE Transactions on Software Engineering
Subcube Allocation and Task Migration in Hypercube Multiprocessors
IEEE Transactions on Computers
Symbolic Gray code as a data allocation scheme for two-disc systems
The Computer Journal - Special issue on information retrieval
A Survey of Combinatorial Gray Codes
SIAM Review
Efficient generation of the binary reflected gray code and its applications
Communications of the ACM
Combinatorial Algorithms: For Computers and Hard Calculators
Combinatorial Algorithms: For Computers and Hard Calculators
Lee Distance and Topological Properties of k-ary n-cubes
IEEE Transactions on Computers
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming)
Reordering columns for smaller indexes
Information Sciences: an International Journal
Reordering rows for better compression: Beyond the lexicographic order
ACM Transactions on Database Systems (TODS)
| Hi-index | 14.98 |
Gray codes, where two consecutive codewords differ in exactly one position by $\pm 1$,are given. In a single radix code, all dimensions have the same base, say $k$, whereas in a mixed radix code the base in one dimension can be different from the base in another dimension. Constructions of new classes of mixed radix Gray codes are presented. It is shown how these codes can be used as a basis for constructing edge disjoint Hamiltonian cycles in mixed radix toroidal networks when the number of dimensions, $n=2^r$ for some $r \geq 0$. Efficient algorithms for the generation of these codes are then shown.