生成拉丁阵合痕类代表元的一种快速算法

A Fast Algorithm of Generating the Representatives of (n,k)-Latin Arrays Istopy Classes

根据拉丁阵自身组合学方面的性质及其在算法设计时的特点 ,给出了一种对拉丁阵进行合痕分类快速而有效的算法 .该算法在一定程度上克服了求解这类问题时随着阶数的增加 ,所需运行时间急剧膨胀的问题 ,并在 Pentium2 0 0机上以有限的时间成功地得到了 ( 4,k) -拉丁阵 ( k=1 ,2 ,… ,1 5)与 ( 5,k) -拉丁阵 ( k=1 ,2 ,3 )的所有合痕类代表元 .

The authors offered fast algorithm for generating the representatives of (n,k) Latin arrays istopy classes which conquered a general disadvantage the run time will sharply expend with the growing of order, and representatives of (4,k)(k=1, 2, …, 15) and (5,k)(k=1,2,3) Latin arrays istopy classes are successfully gained on Pentium 200 computer. This work is very significant to Latin Cryptosystem.