Name
Abstract | ||
|---|---|---|
Overlapped chunked (network) codes are variations of random linear network codes with low computational cost and small coefficient vector overhead, where the source node groups the input packets into chunks with overlapping and the intermediate network nodes only apply linear network coding among packets belonging to the same chunk. In this paper, we introduce a repetition Tanner graph representation of overlapped chunked codes and propose a random design of overlapped chunked codes, called the Repetition Tanner graph based Overlapped Chunked (ROC) codes. We analyze the performance of ROC codes under a general chunk transfer matrix model and demonstrate that ROC codes can achieve higher rates than the state-of-the-art overlapped chunked codes. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/ICC.2016.7511109 | 2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) |
Field | DocType | ISSN |
Linear network coding,Computer science,Block code,Network packet,Computer network,Node (networking),Algorithm,Theoretical computer science,Linear code,Decoding methods,Tanner graph,Encoding (memory) | Conference | 1550-3607 |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bin Tang | 1 | 78 | 15.55 |
| Shenghao Yang | 2 | 33 | 13.84 |