Coding for linear operator channels over finite fields

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 2413-2417

  Yang, Shenghao ^a   Meng, Jin ^b   Yang, En Hui ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL STATISTICS; CODING SCHEME; DECODING ALGORITHM; FIELD SIZE; FINITE FIELDS; LINEAR CODING; LINEAR OPERATORS; METRIC CODES; NETWORK SIZE; PRIORI KNOWLEDGE; RANDOM LINEAR NETWORK CODING; TRANSFORMATION MATRICES;

INFORMATION THEORY; LINEAR NETWORKS; LINEAR TRANSFORMATIONS;

MATHEMATICAL OPERATORS;

EID: 77955690865     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513770     Document Type: Conference Paper

References (7)

1. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inform. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
2. T. Ho, M. Medard, R. Koetter, D. R, Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Trans. Inform. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006. (Pubitemid 46445282)
3. S. Yang, S.-W. Ho, J. Meng, and E.-hui Yang, "Optimality of subspace coding for linear operator channels over finite fields," in Proc. IEEE Information Theory Workshop 2010, Cario, Egypt, 2010.
4. R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. Inform. Theory, vol. 54, no. 8, pp. 3579-3591, Aug. 2008.
5. D. Silva, F. Kschischang, and R. Koetter, "A rank-metric approach to error control in random network coding," IEEE Trans. Inform. Theory, vol. 54, no. 9, pp. 3951-3967, Sept. 2008.
6. E. M. Gabidulin, "Theory of codes with maximum rank distance," Probl. Inform. Transm, vol. 21, no. 1, pp. 1-12, 1985.
7. S. Yang, S.-W. Ho, J. Meng, E.-hui Yang, and R. W. Yeung, "On linear operator channels over finite fields," submitted to IEEE Trans. Inform. Theory, 2010. [Online]. Available: http://arxiv.org/abs/1002.2293