Name
Abstract | ||
|---|---|---|
Abstract Chunked codes are efficient random linear network coding (RLNC) schemes with low computational cost, where the input packets are encoded into small chunks (i.e., subsets of the coded packets). During the network transmission, RLNC is performed within each chunk. In this paper, we first introduce a simple transfer matrix model to characterize the transmission of chunks and derive some basic properties of the model to facilitate the performance analysis. We then focus on the design of overlapped chunked codes, a class of chunked codes whose chunks are non-disjoint subsets of input packets, which are of special interest since they can be encoded with negligible computational cost and in a causal fashion. We propose expander chunked (EC) codes, the first class of overlapped chunked codes that have an analyzable performance, where the construction of the chunks makes use of regular graphs. Numerical and simulation results show that in some practical settings, EC codes can achieve rates within 91 to 97 % of the optimum and outperform the state-of-the-art overlapped chunked codes significantly. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1186/s13634-015-0297-8 | Eurasip Journal on Advances in Signal Processing |
Keywords | Field | DocType |
Random linear network coding,Chunked codes,Iterative decoding,Random regular graph | Linear network coding,Random regular graph,Graph,Computer science,Block code,Network packet,Expander code,Algorithm | Journal |
Volume | Issue | ISSN |
abs/1307.5664 | 106 | 1687-6180 |
Citations | PageRank | References |
1 | 0.36 | 21 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bin Tang | 1 | 78 | 15.55 |
| Shenghao Yang | 2 | 128 | 15.00 |
| Baoliu Ye | 3 | 212 | 32.11 |
| Yitong Yin | 4 | 213 | 23.42 |
| Sanglu Lu | 5 | 1380 | 144.07 |