Complete permutation Gray code implemented by finite state machine

Abstract

An enumerating method of complete permutation array is proposed. The list of n! permutations based on Gray code defined over finite symbol set Z(n) = {1, 2, …, n} is implemented by finite state machine, named as n-RPGCF. An RPGCF can be used to search permutation code and provide improved lower bounds on the maximum cardinality of a permutation code in some cases.

Keywords

• Gray codes
• finite state machines
• complete permutation Gray code
• finite state machine
• enumerating method
• complete permutation array
• n-RPGCF
• search permutation code
• maximum cardinality