Name
Abstract | ||
|---|---|---|
Efficient communication through a multi-hop network with packet loss requires random linear network coding schemes with low computation cost and high throughput. In this paper, we propose a low-density parity-check (LDPC)-based framework for constructing chunked code, a variation of random linear network code with low encoding/decoding computational cost and small coefficient vector overhead. Two ... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TNET.2017.2787726 | IEEE/ACM Transactions on Networking |
Keywords | Field | DocType |
Parity check codes,Decoding,Packet loss,Encoding,Throughput,Spread spectrum communication | Linear network coding,Computer science,Low-density parity-check code,Parallel computing,Network packet,Packet loss,Computer network,Decoding methods,Throughput,Spread spectrum,Encoding (memory) | Journal |
Volume | Issue | ISSN |
26 | 1 | 1063-6692 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bin Tang | 1 | 78 | 15.55 |
| Shenghao Yang | 2 | 128 | 15.00 |