Loss Rate Based Fountain Codes for Data Transfer
Jianxin Liao, Lei Zhang, Xiaomin Zhu, Jingyu Wang, Minyan Liao

TL;DR
This paper introduces LRF fountain codes that adapt encoding based on loss rate, significantly improving efficiency and reducing redundancy compared to LT and Raptor codes for high-speed data transfer.
Contribution
The paper proposes a novel loss rate based degree distribution and dynamic window size for fountain codes, enhancing encoding and decoding performance.
Findings
Better encoding ratio and degree ratio.
Improved encoding and decoding efficiency.
Reduced redundancy in data transfer.
Abstract
Fountain codes are becoming increasingly important for data transferring over dedicated high-speed long-distance network. However, the encoding and decoding complexity of traditional fountain codes such as LT and Raptor codes are still high. In this paper, a new fountain codes named LRF (Loss Rate Based Fountain) codes for data transfer is proposed. In order to improve the performance of encoding and decoding efficiency and decrease the number of redundant encoding symbols, an innovative degree distribution instead of robust soliton degree distribution in LT (Luby Transfer) codes is proposed. In LRF codes, the degree of encoding symbol is decided by loss rate property, and the window size is extended dynamic. Simulations result using LRF codes show that the proposed method has better performance in term of encoding ratio, degree ratio, encoding and decoding efficiency with respect to LT…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Advanced Wireless Communication Techniques · Advanced Data Storage Technologies
