高维大码距Hamilton阵列编码理论与综合算法
The theory of hamilton array codes for high dimension and big hamming distance and the synthesis algorithm
-
摘要: 该文定义了高维大码距Hamilton阵列编码理论的基本概念，分析了d=2k-1(k3)类型和d=2k(k3)类型阵列编码的Hamilton逻辑拓扑结构模型和一般Hamilton阵列编码的存在拓扑条件，并给出d=2k-1(k3)与d=2k(k3)高阶高维Hamilton阵列编码的构造原理和综合算法。文中还讨论了两类模型的区别，以及实例设计，这为新型阵列密码研究提供一个新方向。Abstract: In this paper, the theory of Hamilton array codes for high dimension and big Hamming distance is proposed. The model of logical topology structure for d- 2k-l,d=2k(k 3) types and the existence topology condition for general high order SM array codes are analyzed. The construction principle and the synthesis algorithm of SM array codes for d=2k- 1 and d=2k(k 3) high dimension and high order are discussed. Finally, the distinction between the two models and the example design are given. The result provides a new direction for a class of new type array ciphers research.
-
林柏钢,基于D=2的SM阵列码构造,密码学进展-CHINACRYPT94,第三届中国密码学学术会议论文集,北京,科学出版社,155-160.[2]林柏钢,Sbos相邻逻辑对称序列构造与实现方法,电子科学学刊,1991,13(5),502-508.[3]林柏钢,邱宏端,高维D=3 SM阵列编码构造与实现,电子科学学刊,2000,22(2),198-204.[4]林柏钢,邱宏端,用图论方法实现D=4 SM阵列编码,电路与系统学报,1999,4(4),62-67. ［5］Lin Bogang, The process of integrated learning and the model of parallel search for solution tactics, International Conference Proceeding of ICNNSP95, P.R.China, Dec., 1995, 60-63.[5]C.J.A. Jansen, W. G. Franx, D. E. Boekee, An efficient algorithm for the generation of De-Bruijn cycles, IEEE Trans. on Inform. Theory, 1991, IT-37(5), 1475-1478. -
计量
- 文章访问数: 2171
- HTML全文浏览量: 67
- PDF下载量: 532
- 被引次数: 0
下载:
