A rank-metric approach to error control in random network coding

Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, ITW

Volumn , Issue , 2007, Pages 228-232

  Silva, Danilo ^a   Kschischang, Frank R ^a   Koetter, Ralf ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; INFORMATION THEORY; METROPOLITAN AREA NETWORKS; PROGRAMMING THEORY; RANDOM PROCESSES; SIGNAL ENCODING; TECHNICAL PRESENTATIONS; TELECOMMUNICATION NETWORKS;

ERROR CONTROLS; ERROR LOCATIONS; ERROR VALUES; METRIC CODES; PARTIAL INFORMATIONS; RANDOM NETWORKS;

WIRELESS NETWORKS;

EID: 47849100720     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITWITWN.2007.4318069     Document Type: Conference Paper

References (13)

1. T. Ho, M. Medard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Trans. on Inform. Theory, vol. 52, pp. 4413-4430, Oct. 2006.
2. Z. Zhang, "Network error correction coding in packetized networks," in Proc. of 2006 IEEE Inform. Theory Workshop, 2006.
3. S. Yang and R. W. Yeung, "Characterizations of network error correction/detection and erasure correction," in Proc. NetCod, 2007.
4. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, and M. Médard, "Resilient network coding in the presence of Byzantine adversaries," in Proc. 26th Annual IEEE Conf. on Computer Commun., Anchorage, AK, May 2007.
5. R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding," in Proc. IEEE Int. Symp. Information Theory, Nice, France, June 2007.
6. P. Delsarte, "Bilinear forms over a finite field, with applications to coding theory," J. of Comb. Theory. Series A, vol. 25, pp. 226-241, 1978.
7. E. M. Gabidulin, "Theory of codes with maximum rank distance," Probl. Inform. Transm, vol. 21, no. 1, pp. 1-12, 1985.
8. E. Gabidulin and N. Pilipchuk, "A new method of erasure correction by rank codes," in Proc. IEEE Int. Symp. Information Theory, 29 June-4 July 2003, p. 423.
9. G. Richter and S. Plass, "Error and erasure decoding of rank-codes with a modified Berlekamp-Massey algorithm," in Proc. of ITG Conference on Source and Channel Coding, Erlangen, Germany, January 2004.
10. _, "Fast decoding of rank-codes with rank errors and column erasures," in Proc. IEEE Int. Symp. Information Theory, 27 June-2 July 2004, pp. 398-398.
11. D. Silva, F. R. Kschischang, and R. Koetter, "Using rank-metric codes for error correction in random network coding," 2007, in preparation.
12. R. M. Roth, "Maximum-rank array codes and their application to crisscross error correction," IEEE Trans. on Inform. Theory, vol. 37, pp. 328-336, 1991.
13. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Allerton Conf. on Comm., Control, and Computing, Monticello, IL, October 2003.