Bounds on decoding failure probability in linear network coding schemes with erasure channels

IEEE Communications Letters

Volumn 18, Issue 4, 2014, Pages 648-651

  Seong, Jin Taek ^a  

^a Gwangju Institute of Science and Technology (GIST)   (South Korea)

Author keywords

Linear network coding; lower bound; rank; upper bound

Indexed keywords

DECODING; NETWORK CODING;

DECODING PERFORMANCE; LINEAR COMBINATIONS; LOWER BOUNDS; NETWORK CONNECTION; PERFORMANCE ANALYSIS; RANK; UPPER AND LOWER BOUNDS; UPPER BOUND;

LINEAR NETWORKS;

EID: 84899643841     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2014.022714.140158     Document Type: Article

References (7)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network informationflow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Apr. 2000.
2. T. Ho, M. Medar, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B.Leng, "A random linear network coding approach to multicast," IEEETrans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006. (Pubitemid 46445282)
3. O. T.-Cruces, J. M. B.-Ordinas, and M. Fiore, "Exact decoding probabilityunder random linear network coding," IEEE Commun. Lett., vol. 15, no.1, pp. 67-69, Jan. 2011.
4. C.-F. Chiasserini, E. Viterbo, and C. Casetti, "Decoding probability inrandom linear network coding with packet losses," IEEE Commun. Lett.,vol. 17, no. 11, pp. 2128-2131, Nov. 2013.
5. C. Gkantsidis and P. R. Rodriguez, "Network coding for large scalecontent distribution," in Proc. 2005 IEEE INFOCOM, pp. 2235-2245.
6. M. Xiao and M. Skoglund, "Multiple-user cooperative communicationsbased on linear network coding," IEEE Trans. Commun., vol. 58, no. 12,pp. 3345-3351, Dec. 2010.
7. J. L. Rebelatto, B. F. U-Filho, Y. Li, and B. Vucetic, "Multiusercooperative diversity through network coding based on classical codingtheory," IEEE Trans. Signal Process., vol. 60, no. 2, pp. 916-926, Feb.2012.