Name
Abstract | ||
|---|---|---|
BATS codes are a class of low complexity random linear network codes with high throughput. In a previous work, BATS codes were generalized to incorporate batches of different sizes, and a sufficient condition was obtained such that the belief propagation decoding can recover a given fraction of the input packets with high probability. In this paper, by investigating an optimization problem induced by the sufficient condition, we derive a condition such that it is optimal to use a constant batch size. This condition gives us a guideline for designing practical network protocol based on BATS codes. Moreover, we prove that this condition is always satisfied in line networks. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/LCOMM.2017.2713813 | IEEE Communications Letters |
Keywords | Field | DocType |
Decoding,Complexity theory,Optimization,Network coding,Encoding,Protocols,Electronic mail | Linear network coding,Computer science,Network packet,Block code,Algorithm,Real-time computing,Theoretical computer science,Throughput,Decoding methods,Optimization problem,Encoding (memory),Communications protocol | Journal |
Volume | Issue | ISSN |
21 | 9 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qiaoqiao Zhou | 1 | 1 | 0.70 |
| Shenghao Yang | 2 | 33 | 13.84 |
| Yin, H.H.F. | 3 | 0 | 0.68 |
| Bin Tang | 4 | 78 | 15.55 |