摘要
在处理离散元素的集合时 ,我们经常要对集合的元素进行组合。组合的顺序显得非常重要 ,组合顺序选得好可以给问题的解决带来方便。为使全态组合数的计算复杂度最小 ,一般按格雷码序进行 ,本文给出一种组合顺序 ,并基于此顺序给出全态组合数的一种扩展算法。其计算复杂度最优且对有些应用更为方便 ,如线性分组码的计算 ,速度提高约kn倍。
This paper states that the combination of elements of a finite set is often considered in mathematics It also points out that the order of the combination is important and a suitable order is convenient in addressing some questions In order to enumerate all combination of a finite set, the Gray code is a good choice This paper gives another order and a new optimal algorithm based on it to enumerate all combination of a finite set The algorithm is more convenient in some application
出处
《武汉职业技术学院学报》
2003年第2期78-80,共3页
Journal of Wuhan Polytechnic
