2022
DOI: 10.1007/978-3-030-93398-2_43
|View full text |Cite
|
Sign up to set email alerts
|

Low Overhead Growth Degree Coding Scheme for Online Fountain Codes with Limited Feedback

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…The idea merge between the high degree output packets with some low degree one to avoid decoding block. Belief propagation algorithm is modified to find a solution for an empty ripple size for short length blocks is presented in [19]- [25]. From these previous works, it is evident that the short length data files need an adjustment for the degrees of the encoded packets as well as the way of selection to the data packets required to form the encoded one.…”
Section: Introductionmentioning
confidence: 99%
“…The idea merge between the high degree output packets with some low degree one to avoid decoding block. Belief propagation algorithm is modified to find a solution for an empty ripple size for short length blocks is presented in [19]- [25]. From these previous works, it is evident that the short length data files need an adjustment for the degrees of the encoded packets as well as the way of selection to the data packets required to form the encoded one.…”
Section: Introductionmentioning
confidence: 99%