Name
Abstract | ||
|---|---|---|
Linear operator channels (LOCs) are motivated by the communications through networks employing random linear network coding (RLNC). Following the recent information theoretic results about LOCs, we propose two coding schemes for LOCs and evaluate their performance. These schemes can be used in networks employing RLNC without constraints on the network size and the field size. Our first scheme makes use of rank-metric codes and generalizes the rank-metric approach of subspace coding proposed by Silva et al. Our second scheme applies linear coding. The second scheme can achieve higher rate than the first scheme, while the first scheme has simpler decoding algorithm than the second scheme. Our coding schemes only require the knowledge of the expectation of the rank of the transformation matrix. The second scheme can also be realized ratelessly without any priori knowledge of the channel statistics. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ISIT.2010.5513770 | ISIT |
Keywords | Field | DocType |
linear operator channel coding,transformation matrix,linear codes,statistical analysis,matrix algebra,channel coding,random linear network coding,information theory,decoding algorithm,channel statistics,subspace coding,decoding,rank-metric codes,network coding,galois fields,network topology,generators,statistics,linear operator,finite field,cascading style sheets,encoding,lab on a chip,channel capacity,linear code,communication networks,transmitters | Linear network coding,Information theory,Discrete mathematics,Combinatorics,Subspace topology,Computer science,Coding (social sciences),Linear map,Decoding methods,Transformation matrix,Channel capacity | Conference |
ISBN | Citations | PageRank |
978-1-4244-7891-0 | 12 | 0.82 |
References | Authors | |
11 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shenghao Yang | 1 | 128 | 15.00 |
| Jin Meng | 2 | 32 | 5.82 |
| En-Hui Yang | 3 | 1097 | 94.93 |