Complete permutation Gray code implemented by finite state machine
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 boun...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-09-01
|
| Series: | The Journal of Engineering |
| Subjects: | |
| Online Access: | http://digital-library.theiet.org/content/journals/10.1049/joe.2014.0214 |