计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (19): 121-123.

• 网络、通信、安全 • 上一篇    下一篇

正形置换的一种新递归构造方法

郑浩然,崔 霆,史建红   

  1. 信息工程大学 电子技术学院,郑州 450004
  • 收稿日期:2007-09-25 修回日期:2007-12-14 出版日期:2008-07-01 发布日期:2008-07-01
  • 通讯作者: 郑浩然

New recursive construction method of orthomorphic permutations

ZHENG Hao-ran,CUI Ting,SHI Jian-hong   

  1. Institute of Electronic Technology,Information Engineering University,Zhengzhou 450004,China
  • Received:2007-09-25 Revised:2007-12-14 Online:2008-07-01 Published:2008-07-01
  • Contact: ZHENG Hao-ran

摘要: 提出了复合截集的概念,基于复合截集给出了由n元正形置换构造n+1元正形置换的新的递归构造方法,并解决了相应的计数问题。

Abstract: In this paper,the concept of composite transversal is proposed.Based on this concept,a new recursive construction method of orthomorphic permutations with n+1-variable from one with n-variable is given,and the enumeration problem based on this construction method is solved.