• 作者： 官大智
• 中文摘要： An efficient algorithm for enumerating a sequence of all elements in (Z/sub n/)/sup k/ in a special order is presented. The sequence enumerated is called the (n,k)-Gray code. It has the property that each pair of adjacent elements differs in only one digit and the difference is either +1 or -1. This sequence can be efficiently applied to calculation of the weight polynomial of a group code. We also show that the Tower of Hanoi problem, in which disks can only be moved to the adjacent pegs, can be solved by enumerating the (3,k)-Gray code, where k is the number of disks to be moved. Finally, we show that the enumeration of the (n,k)-Gray code can also be regarded as a Hamiltonian path in a generalized hypercube network.
• 英文摘要： --
• 中文關鍵字： (n,k)-Gray code, weight polynomial, tower of Hanoi, Hamiltonian path, hypercube network
• 英文關鍵字： --