Low-complexity Secure Network Coding Algorithm Based on Sparse Matrix
Fu Xiao · Jisuanji gongcheng · 2012
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.