Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Loss Rate Based Fountain Codes for Data Transfer (1305.2387v1)

Published 10 May 2013 in cs.NI, cs.IT, and math.IT

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 and Raptor codes.

Citations (1)

Summary

We haven't generated a summary for this paper yet.