2019
DOI: 10.1109/lcomm.2019.2915670
|View full text |Cite
|
Sign up to set email alerts
|

Online Fountain Codes With Unequal Recovery Time

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
4
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 12 publications
0
4
0
Order By: Relevance
“…Fountain codes also display superior performance in data storage [82] and data distribution [83] scenarios. In addition, for scenarios where data such as video multicast applications [84,85] have different priorities, fountain codes with unequal error protection have also been proposed.…”
Section: Fountain Codementioning
confidence: 99%
“…Fountain codes also display superior performance in data storage [82] and data distribution [83] scenarios. In addition, for scenarios where data such as video multicast applications [84,85] have different priorities, fountain codes with unequal error protection have also been proposed.…”
Section: Fountain Codementioning
confidence: 99%
“…According to the literature [18], this fountain coding scheme can achieve a high intermediate decoding rate by using feedback information to predict the decoder state and dynamically adjusting the non-uniform symbol selection distribution. The literature [19,20] suggested modifying the LT code degree-1 and Online Fountain Codes without a build-up phase, respectively, by modifying the quantity of degree-1 coded symbols, doing away with the stacking phase, enhancing Belief Propagation (BP) decoding performance, and making sure that the received coded symbols are recovered as soon as possible. The degree distribution of the robust soliton distribution is then optimized in literature [21], and it is suggested to reorder the degree distribution from large to small in order to delay the emergence of degree-1 symbols.…”
Section: Introductionmentioning
confidence: 99%
“…[15] uses an extended window strategy as well as a uniform random selection strategy for group decoding of codewords with different priorities, which improves the recovery time of high-priority symbols with little overall overhead performance loss. In [16], a Gaussian elimination algorithm is introduced, and the data erasure probability is used to adjust the degree distribution design of the LT codes. [17] uses the decoding states of all the receivers to update the encoded symbol degrees and stores the received encoded symbols that cannot be decoded immediately and decodes them later so that the system reduces the multistate effect and improves the recovery performance of the system.…”
Section: Introductionmentioning
confidence: 99%