An approach of eliminating duplicate associates in fountain codes

  • Authors:

  • Yang Zhou;Lin Zhang;Yu Liu

  • Affiliations:

  • School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing, China;School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing, China;School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing, China

  • Venue:
  • WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
  • Year:
  • 2009

  • LT Codes

    FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science

  • Raptor codes

    IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory

Quantified Score

Hi-index 0.00

Visualization

Abstract

Fountain codes are a new type of erasure codes. Because of distinctive coding method, low complexity of implementation, and high reliable transmission, they are particularly promising in practice. In this paper, we discuss the problem of duplicate associates in practical LT codes, which results in the generation of invalid encoding symbols. The reason why it happens is analyzed, and the probability that the problem appears is inferred. Furthermore, we propose an improved algorithm to eliminate the duplicate associates. The simulation results reveal that the proposed algorithm presents better performance than the original solution by solving this problem completely.