基于贪心算法构成的正交矩阵及保密通信  

Orthogonal matrix based on Greedy algorithm and secure communication

作　　者：单侠芹[1] 潘洋[1] 赵华[1] 殷奎喜[1] 张倩茹[1] 

机构地区：[1]南京师范大学物理科学与技术学院,江苏南京210046

出　　处：《电子设计工程》2011年第6期95-97,共3页Electronic Design Engineering

基　　金：虚拟地理环境教育部重点实验室开放项目(NS206005)

摘　　要：提出用贪心算法来构成全正交或类正交矩阵的方法。首先,建立模型,并对该模型进行仿真验证,统计对应列数r一定时的全正交或类正交矩阵数量,进而分析这些矩阵的性质,如唯一性、均衡性、行列正交性以及r变化时的矩阵数量。其次,在此基础上,对其在保密通信中的应用进行了分析和实现,从而说明这种矩阵在保密通信中的可行性和实用性,因其在大小上不受任何限制,数量上较相同列数的walsh矩阵多得多,为保密通信的提供更多的可用密钥序列。This paper proposed the method of using the Greedy algorithm to generate the orthogonal matrix or Similar orthogonal matrix. First, it built the model, and simulated it. By counting the number of orthogonal matrix or Similar orthogonal matrix when r is constant, it analyzed the characteristics of these matrixes, such as uniqueness, balance, orthogonality and the number of matrix when r changed. Next, based on this, this paper analyzed application of the method in secure communication to illustrate the feasibility and practicality of the matrix. Compared with walsh matrix, the size and quantity of this matrix have many advantages. So, it provides more key sequences for secure communication.

关 键 词：贪心算法 正交矩阵 保密通信 WALSH 

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