一种基于格雷码与one-hot混合编码思想的组合数生成算法  

A combination number generation algorithm based on Gray code and one-hot hybrid coding

作　　者：英昌盛[1] 李紫薇 尹继一 孙浩然 李享 YING Chang-sheng;LI Zi-wei;YIN Ji-yi;Sun Hao-ran;LI Xiang(College of Computer,Jilin Normal University,Siping 136000,China)

机构地区：[1]吉林师范大学计算机学院,吉林四平136000

出　　处：《吉林师范大学学报（自然科学版）》2021年第3期105-109,共5页Journal of Jilin Normal University:Natural Science Edition

基　　金：国家自然科学基金项目(62972384);吉林省教育厅“十三五”科学技术项目(JJKH20210457KJ);吉林省教育厅教改课题(2018ZCZ006,JLCR611720190723010810,2019ZCY361)。

摘　　要：为解决组合数生成算法复杂、效率低及空间占用率高等问题,提出一种基于格雷码与one-hot混合编码思想的组合数生成算法.算法融合了格雷码的编码可靠性和one-hot编码的离散特性及扩展性,采用非递归方式生成格雷码,基于one-hot编码思想存储格雷码.与基于字典序的常规组合数生成算法相比,本文提出算法的空间占用率仅为其1/n,同时具有更优的生成效率.In order to solve the problems of complex algorithm,low efficiency and high space occupancy,a combination number generation algorithm based on Gray code and one-hot hybrid coding was proposed.The algorithm combines the coding reliability of Gray code with the discrete characteristics and expansibility of one-hot coding,generates Gray code in a non-recursive way,and stores the generated Gray code based on the idea of one-hot coding.Compared with conventional lexicographic-based algorithms,the proposed algorithm has much smaller space occupancy rate and better generation efficiency.

关 键 词：格雷码 one-hot编码 组合数 生成效率 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]