Complete permutation Gray code implemented by finite state machine

The Journal of Engineering

Li Peng¹  Hao Li²  Xin Li³  Pingliang Zeng³ 

[1] Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan 430074, People'Power System Department, China Electric Power Research Institute, Beijing 100192, People's Republic of China

关键词: search permutation code;    enumerating method;    n-RPGCF;    complete permutation Gray code;    finite state machine;    maximum cardinality;    complete permutation array;   

DOI  :  10.1049/joe.2014.0214

学科分类：工程和技术（综合）

来源: IET

【 摘 要 】

An enumerating method of complete permutation array is proposed. The list of n! permutations based on Gray code defined over finite symbol set Zn = {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.

【 授权许可】

CC BY