高维大码距Hamilton阵列编码理论与综合算法  

THE THEORY OF HAMILTON ARRAY CODES FOR HIGH DIMENSION AND BIG HAMMING DISTANCE AND THE SYNTHESIS ALGORITHM

作　　者：林柏钢[1] 

机构地区：[1]福州大学计算机系,福州350002

出　　处：《电子与信息学报》2003年第7期907-917,共11页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(60172017);福建省自然科学基金(A0010011)

摘　　要：该文定义了高维大码距Hamilton阵列编码理论的基本概念,分析了d=2k-1(k≥3)类型和d=2k(k≥3)类型阵列编码的Hamilton逻辑拓扑结构模型和一般Hamilton阵列编码的存在拓扑条件,并给出d=2k-1(k≥3)与d=2k(k≥3)高阶高维Hamilton阵列编码的构造原理和综合算法。文中还讨论了两类模型的区别,以及实例设计,这为新型阵列密码研究提供一个新方向。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 - 1,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 = 1k(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.

关 键 词：编码理论 拓扑结构 存在约束条件 综合算法 高维大码距Hamilton阵列 阵列密码 

分 类 号：TN918.2[电子电信—通信与信息系统]