DocumentCode :
3070768
Title :
Coding for linear operator channels over finite fields
Author :
Yang, Shenghao ; Meng, Jin ; Yang, En-Hui
Author_Institution :
Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China
fYear :
2010
fDate :
13-18 June 2010
Firstpage :
2413
Lastpage :
2417
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.
Keywords :
channel coding; decoding; linear codes; matrix algebra; network coding; statistical analysis; channel statistics; decoding algorithm; information theory; linear operator channel coding; random linear network coding; rank-metric codes; subspace coding; transformation matrix; Cascading style sheets; Channel capacity; Communication networks; Decoding; Galois fields; Lab-on-a-chip; Network coding; Network topology; Statistics; Transmitters;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location :
Austin, TX
Print_ISBN :
978-1-4244-7890-3
Electronic_ISBN :
978-1-4244-7891-0
Type :
conf
DOI :
10.1109/ISIT.2010.5513770
Filename :
5513770
Link To Document :
بازگشت