Name
Abstract | ||
|---|---|---|
Batched sparse (BATS) codes have been proposed for communication through networks with packet loss. BATS codes include a matrix generalization of fountain codes as the outer code and random linear network coding at the intermediate network nodes as the inner code. BATS codes, however, do not possess a universal degree distribution that achieves the optimal rate for any distribution of the transfer matrix ranks, so that fast performance evaluation of finite-length BATS codes is important for optimizing the degree distribution. The state-of-the-art finite-length performance evaluation method has a computational complexity of O(K 2 n 2 M), where K, n, and M are the number of input symbols, the number of batches, and the batch size, respectively. We propose a polynomial-form formula for finite-length BATS codes performance evaluation with the computational complexity of O(K 2 n ln n). Numerical results demonstrate that the polynomial-form formula can be significantly faster than the previous methods. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/LCOMM.2016.2619698 | IEEE Communications Letters |
Keywords | Field | DocType |
Decoding,Network coding,Packet loss,Performance evaluation,Computational complexity | Concatenated error correction code,Combinatorics,Polynomial,Fountain code,Matrix (mathematics),Degree distribution,Linear code,Decoding methods,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
21 | 1 | 1089-7798 |
Citations | PageRank | References |
2 | 0.41 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huakai Zhao | 1 | 2 | 0.41 |
| Shenghao Yang | 2 | 33 | 13.84 |
| Guangliang Dong | 3 | 9 | 2.66 |