On the Sparsity of a Linear Network Code for Broadcast Systems with Feedback
One method for reducing the decoding complexity of network coding in wireless broadcast systems is to generate sparse encoding vectors. The problem of finding the minimal Hamming weight of innovative encoding vectors over large finite field is formulated. By reducing the problem of hitting set to it, we show that the problem is NP-hard. However when the number of users is fixed, the problem can then be solved in polynomial time. A systematic method for solving the problem is provided.
Chi Wan Sung Kenneth W.Shum Ho Yuet Kwan
Department of Electronic Engineering City University of Hong Kong Institute of Network Coding The Chinese University of Hong Kong
国际会议
2011 International Symposium on Network Coding(2011网络编码国际会议 NETCOD 2011)
北京
英文
1-4
2011-07-25（万方平台首次上网日期，不代表论文的发表时间）