作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (9): 55-57. doi: 10.3969/j.issn.1000-3428.2012.09.017

• 网络与通信 • 上一篇    下一篇

基于稀疏矩阵的低复杂度安全网络编码算法

徐光宪,付 晓   

  1. (辽宁工程技术大学电子与信息工程学院,辽宁 葫芦岛 125105)
  • 收稿日期:2011-09-05 出版日期:2012-05-05 发布日期:2012-05-05
  • 作者简介:徐光宪(1977-),男,副教授、博士,主研方向:网络编码,信号处理;付 晓,硕士研究生
  • 基金资助:
    辽宁省高等学校科学研究立项计划基金资助项目(2009 S051)

Low-complexity Secure Network Coding Algorithm Based on Sparse Matrix

XU Guang-xian, FU Xiao   

  1. (School of Electronic and Information Engineering, Liaoning Technical University, Huludao 125105, China)
  • Received:2011-09-05 Online:2012-05-05 Published:2012-05-05

摘要: 针对安全网络编码复杂度较大的问题,提出一种基于稀疏矩阵的安全网络编码算法。利用稀疏矩阵占用较少的存储空间和运算速度快的优点,在信源处将信源信息与稀疏矩阵进行矩阵变换操作,使得随机网络编码能以较高的概率达到信息论安全的要求。仿真结果表明,该算法能提高编解码速率,降低复杂度,减少存储空间。

关键词: 网络编码, 稀疏矩阵, 矩阵变换, 信息论安全, 低复杂度

Abstract: Aiming at the high complexity of coding of secure network, this paper proposes a secure network coding algorithm based on sparse matrix. The sparse matrix has a fast computing speed and occupies smaller memory space, so the algorithm transforms the information source news with sparse matrix. The algorithm can achieve the information-theoretic security condition at a high probability. Simulation results confirm that the algorithm can increase the encoding and decoding rate, reduce the computational complexity and the memory space.

Key words: network coding, sparse matrix, matrix transformation, information-theoretic security, low-complexity

中图分类号: