Adversarial error correction for network coding: Models and metrics

46th Annual Allerton Conference on Communication, Control, and Computing

Volumn , Issue , 2008, Pages 1246-1253

  Silva, Danilo ^a   Kschischang, Frank R ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COHERENT NETWORKS; DESTINATION NODES; ERROR CORRECTION CAPABILITIES; ERROR-CORRECTING CODES; NETWORK CODES; NETWORK CODING; NETWORK TOPOLOGIES; NON-COHERENT; SINGLETON BOUNDS; SUBSPACE DISTANCES; SUBSPACE METRIC; UNIVERSAL NETWORKS;

COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; ELECTRIC NETWORK TOPOLOGY;

ERROR CORRECTION;

EID: 64549135473     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2008.4797703     Document Type: Conference Paper

References (14)

1. N. Cai and R. W. Yeung, "Network coding and error correction," in Proc. 2002 IEEE Inform. Theory Workshop, Oct. 20-25, 2002, pp. 119-122.
2. R. W. Yeung and N. Cai, "Network error correction, part I: Basic concepts and upper bounds," Commun. Inform. Syst., vol. 6, no. 1, pp. 19-36, 2006.
3. N. Cai and R. W. Yeung, "Network error correction, part II: Lower bounds," Commun. Inform. Syst., vol. 6, no. 1, pp. 37-54, 2006.
4. S. Yang and R. W. Yeung, "Characterizations of network error correction/detection and erasure correction," in Proc. NetCod 2007, San Diego, CA, Jan. 2007.
5. Z. Zhang, "Linear network error correction codes in packet networks," IEEE Trans. Inf. Theory, vol. 54, no. 1, pp. 209-218, 2008.
6. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, M. Medard, and M. Effros, "Resilient network coding in the presence of byzantine adversaries," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2596-2603, Jun. 2008.
7. R. Kötter and F. R. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3579-3591, Aug. 2008.
8. D. Silva, F. R. Kschischang, and R. Kötter, "A rank-metric approach to error control in random network coding," IEEE Trans. Inf. Theory, vol. 54, no. 9, pp. 3951-3967, 2008.
9. S. Yang and R. W. Yeung, "Refined coding bounds for network error correction," in Proc. 2007 IEEE Information Theory Workshop, Bergen, Norway, Jul. 1-6, 2007, pp. 1-5.
10. S. Yang, C. K. Ngai, and R. W. Yeung, "Construction of linear network codes that achieve a refined Singleton bound," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 24-29, 2007, pp. 1576-1580.
11. R. Matsumoto, "Construction algorithm for network error-correcting codes attaining the Singleton bound," IEICE Transactions on Fundamentals, vol. E90-A, no. 9, pp. 1729-1735, Sep. 2007.
12. E. M. Gabidulin, "Theory of codes with maximum rank distance," Probl. Inform. Transm, vol. 21, no. 1, pp. 1-12, 1985.
13. R. M. Roth, "Maximum-rank array codes and their application to crisscross error correction," IEEE Trans. Inf. Theory, vol. 37, pp. 328-336, 1991.
14. D. Silva and F. R. Kschischang, "On metrics for error correction in network coding," 2008, submitted for publication. [Online]. Available: http://arxiv.org/abs/0805.3824