2016 IEEE International Symposium on Information Theory (ISIT) 2016
DOI: 10.1109/isit.2016.7541719
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive recoding for BATS codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
56
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 34 publications
(56 citation statements)
references
References 8 publications
0
56
0
Order By: Relevance
“…Note that in the definition of the expected rank, we consider the next network node in lieu of the current node. The reason is that in adaptive recoding schemes [ 30 , 44 ], the goal is to find the optimal number of recoded packets such that the batches can sustain the most information at the next node.…”
Section: Bats Codesmentioning
confidence: 99%
See 4 more Smart Citations
“…Note that in the definition of the expected rank, we consider the next network node in lieu of the current node. The reason is that in adaptive recoding schemes [ 30 , 44 ], the goal is to find the optimal number of recoded packets such that the batches can sustain the most information at the next node.…”
Section: Bats Codesmentioning
confidence: 99%
“…However, Reference [ 41 ] did not propose a method to find the optimal solution. Later, designs focusing on the optimal solution which can produce more efficient BATS codes were proposed in References [ 30 , 44 ]. These approaches are referred to as adaptive recoding.…”
Section: Recoding Schemesmentioning
confidence: 99%
See 3 more Smart Citations