Performance evaluation of constant dimension subspace code for error and erasures correcting in linear network coding

Aicha Guefrachi, Sonia Zaibi Ammar, Ammar Bouallègue

Abstract


In random linear network coding (R.L.N.C.), intermediate node has the opportunity to sent a packet that is a random F-linear combination of packet it received. Thus, a corrupt packet may contaminate other packets when coded with them and a phenomenon of error propagation was introduced. Coding

theories for error correcting started with N.Cai and R.Yeung and a code construction was proposed by Kötter and Kschischang (said KK code) in the context of a noncoherent transmission model for random linear network coding that captures the effects both of errors and of erasures. In this paper, we evaluate the performance of such constant dimension subspace code for random and deterministic network coding in terms of packet error rate (P.E.R.).


Keywords


Constant-dimension codes, Galois fields, Random linear network coding (R.L.N.C.), Subspace codes.

References


A. Al Hamra, C. Barakat, T. Turletti, “ Network coding for wireless mesh networks: a case study,” WOWMOM '06 Proceedings of the International Symposium on World of Wireless, Mobile and Multimedia Networks, vol. 9, pp. 103 -114, 2006.

D. Silva, FR. Kschischang, and R. Kötter,, “A Rank-metric approach to error control in random network coding,” IEEE Trans. Info. Theory, vol. 54, no. 9, pp. 3951–3967, SeptemB.E.R. 2008.

Jingyao Zhang, K. B. Letaief and Pingyi FanA, “Distributed Product Coding Approach For Robust Network Coding,” International Conference on . 10.1109/ICC.2008.40, pp. 176 - 180,2008.

N.Cai and R.Yeung, “Network coding and error correction,” IEEE Inform. Theory Workshop, Bangalore, India, pp.119-122, Oct 2002.

Ning Chen, Zhiyuan Yan, Maximilien Gadouleau, Ying Wang and Bruce W.Suter “Rank metric decoder architectures for random linear network coding with error control, ” IEEE Trans. vol. 20 , no. 2, pp. 296 - 309, Feb. 2012.

Pau B.E.R.nat and Guri Hundertmark, “Bit error combating cetwork coding techniques,” June 2010.

R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, “Network

information flow, ” IEEE Info. Theory, vol. 46, no. 4, pp. 1024-1016, 2000.

R. Koetter and F.R. Kschischang, “Coding for errors and erasures in

random network coding, ” IEEE Trans. Info. Theory, vol. 54, no. 8, pp.

- 3591, 2008.

R.Koetter and M.Médard, “An algebraic approach to network coding”,

IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782–795, Oct. 2003.

R.W. Yeung and Z. Zhang, “Distributed source coding for satellite communications,” IEEE Trans. Inform. Theory, IT- 45: 1111-1120, 1999.

RW. Yeung, SYR. Li, N. Cai, and Z. Zhang, “Network coding theory,”

now Publishers, 2005.

SYR. Li, RW. Yeung, and N. Cai, "Linear network coding", IEEE Trans. Info. Theory, vol. 49, no. 2,pp. 371-381, 2003.

T.Ho, M. Medard, R. K"{¨o}tter, D.R. Karger, M. Effros, J. Shi, and

B. Leong, "A random linear network coding approach to multicast", IEEE Trans. on Info. Theory, vol. 52, no. 10, pp. 4413- 4430, 2006.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




 


All Rights Reserved © 2012 IJARCSEE


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.