English

Generation of Innovative and Sparse Encoding Vectors for Broadcast Systems with Feedback

Information Theory 2016-11-17 v2 Computational Complexity math.IT

Abstract

In the application of linear network coding to wireless broadcasting with feedback, we prove that the problem of determining the existence of an innovative encoding vector is NP-complete when the finite field size is two. When the finite field size is larger than or equal to the number of users, it is shown that we can always find an encoding vector which is both innovative and sparse. The sparsity can be utilized in speeding up the decoding process. An efficient algorithm to generate innovative and sparse encoding vectors is developed. Simulations show that the delay performance of our scheme with binary finite field outperforms a number of existing schemes in terms of average and worst-case delay.

Keywords

Cite

@article{arxiv.1102.3527,
  title  = {Generation of Innovative and Sparse Encoding Vectors for Broadcast Systems with Feedback},
  author = {Ho Yuet Kwan and Kenneth W. Shum and Chi Wan Sung},
  journal= {arXiv preprint arXiv:1102.3527},
  year   = {2016}
}

Comments

5 pages, 4 figures, accepted for publication in the Proc. of IEEE ISIT 2011

R2 v1 2026-06-21T17:27:45.882Z