Name
Abstract | ||
|---|---|---|
Chunked network code is a variation of random linear network code with low computational cost and small coefficient vector overhead. In a chunked network code, intermediate network nodes only apply network coding among packets of the same chunk. In this paper, we propose an approach to construct chunks using LDPC codes. For a given LDPC code, the chunks are simply formed by first partitioning the variable nodes into disjoint groups and then filling each group with a number of variable nodes of degree zero. The chunked network codes constructed using this approach are called L-chunked codes. We analyze the asymptotic achievable rates of L-chunked codes using belief propagation decoding for an arbitrary rank distribution of the chunk transfer matrices. Numerical evaluation shows that L-chunked codes achieve a rate very close to optimal. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ITW.2014.6970863 | ITW |
Keywords | Field | DocType |
chunk transfer matrices,arbitrary rank distribution,ldpc codes,numerical analysis,variable nodes,linear network code,l-chunked codes,numerical evaluation,chunked network codes,parity check codes,intermediate network nodes,network coding | Forward error correction,Discrete mathematics,Concatenated error correction code,Low-density parity-check code,Computer science,Turbo code,Block code,Serial concatenated convolutional codes,Theoretical computer science,Raptor code,Tornado code | Conference |
ISSN | Citations | PageRank |
1662-9019 | 9 | 0.62 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shenghao Yang | 1 | 33 | 13.84 |
| Bin Tang | 2 | 78 | 15.55 |