Name
Abstract | ||
|---|---|---|
BATS codes are a class of efficient random linear network codes. In this letter, BATS codes are generalized to incorporate batches of different sizes, and the corresponding belief propagation (BP) decoding performance is studied. Using a tree-based analysis, a sufficient condition is obtained such that the BP decoder can recover a given fraction of the input symbols with high probability. Some assumptions in the previous works are relaxed in our analysis so that the analytical results can be applied to more general scenarios. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/LCOMM.2015.2499192 | IEEE Communications Letters |
Keywords | Field | DocType |
Decoding,Network coding,Encoding,Iterative decoding,Differential equations,Generators | Discrete mathematics,Online codes,Luby transform code,Fountain code,Block code,Expander code,Reed–Muller code,Linear code,Mathematics,Belief propagation | Journal |
Volume | Issue | ISSN |
20 | 1 | 1089-7798 |
Citations | PageRank | References |
4 | 0.47 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shenghao Yang | 1 | 33 | 13.84 |
| Qiaoqiao Zhou | 2 | 4 | 0.47 |