2011 IEEE International Symposium on Information Theory Proceedings 2011
DOI: 10.1109/isit.2011.6034050
|View full text |Cite
|
Sign up to set email alerts
|

Coding for a network coded fountain

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
54
0
1

Year Published

2011
2011
2017
2017

Publication Types

Select...
3
2
2

Relationship

4
3

Authors

Journals

citations
Cited by 69 publications
(56 citation statements)
references
References 10 publications
0
54
0
1
Order By: Relevance
“…BATS code [13,14] is the first class of chunked codes that uses coded chunks. Each chunk in a BATS code is generated as linear combinations of a random subset of the input packets.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…BATS code [13,14] is the first class of chunked codes that uses coded chunks. Each chunk in a BATS code is generated as linear combinations of a random subset of the input packets.…”
Section: Related Workmentioning
confidence: 99%
“…In coded chunked codes, chunks are generated by combining multiple input packets. By generalizing fountain codes and LDPC codes, nearly throughput optimal chunked codes have been designed, including BATS code [13,14], Gamma code [15,16], and L-chunked (LC) code [17]. Overlapped chunks can be viewed as a degraded class of coded chunks where chunks are generated using certain repetition codes.…”
Section: Introductionmentioning
confidence: 99%
“…To address the issues of the schemes discussed in Sections 2 and 3, a class of generalized LT/Raptor codes, called batched sparse (BATS) codes, are proposed [21]. BATS codes are designed to be used with networks employing linear network coding, while preserving the properties of fountain codes such as ratelessness and low encoding/decoding complexity.…”
Section: Batched Sparse Codesmentioning
confidence: 99%
“…Taking the network in Figure 1 as an example, by allowing the intermediate node to cache only one batch, the transmission rate of a BATS code can achieve the min-cut when the batch size goes to infinity and remains satisfactory for small batch sizes (see the simulation results in [21]). However, the overlapped chunked schemes [17,6,10] are designed for random scheduling, which results in an intermediate node caching all the chunks.…”
Section: Batches and Chunksmentioning
confidence: 99%
See 1 more Smart Citation