Security for wiretap networks via rank-metric codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 176-180

  Silva, Danilo ^a   Kschischang, Frank R ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CODING SCHEMES; COMMUNICATION NETWORKS; INTERNATIONAL SYMPOSIUM; MDS CODES; METRIC CODES; NETWORK CODING; TYPE II; WIRE-TAP CHANNEL;

CODES (STANDARDS); CODES (SYMBOLS); COMMUNICATION; COMMUNICATION SYSTEMS; CYBERNETICS; INFORMATION THEORY; LINEAR NETWORKS; TECHNICAL PRESENTATIONS;

PROGRAMMING THEORY;

EID: 52349119694     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4594971     Document Type: Conference Paper

References (15)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
2. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," vol. 49, no. 2, pp. 371-381, Feb. 2003.
3. R. Koetter and M. Médard, "An algebraic approach to network coding," vol. 11, no. 5, pp. 782-795, Oct. 2003.
4. N. Cai and R. W. Yeung, "Secure network coding," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun. 30-Jul. 5, 2002, p. 323.
5. J. Feldman, T. Malkin, C. Stein, and R. A. Servedio, "On the capacity of secure network coding," in Proc. 42nd Annual Allerton Conf. on Cornmun., Control, and Computing, Sep. 2004.
6. S. Y. E. Rouayheb and E. Soljanin, "On wiretap networks II," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 24-29, 2007, pp. 551-555.
7. L. H. Ozarow and A. D. Wyner, "Wire tap channel II," AT&T Bell Labs. Tech. J., vol. 63, no. 10, pp. 2135-2157, Dec. 1984.
8. _, "Wire-tap channel II," in Proc. EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques. New York, NY, USA: Springer-Verlag New York, Inc., 1985, pp. 33-51.
9. E. M. Gabidulin, "Theory of codes with maximum rank distance," Probl. Inform. Transm, vol. 21, no. 1, pp. 1-12, 1985.
10. R. M. Roth, "Maximum-rank array codes and their application to crisscross error correction," vol. 37, pp. 328-336, 1991.
11. G. Richter and S. Plass, "Error and erasure decoding of rankcodes with a modified Berlekamp-Massey algorithm," in Proc. ITG Conf. on Source and Channel Coding, Erlangen, Germany, Jan. 2004.
12. M. Gadouleau and Z. Yan, "Properties of codes with the rank metric," in Proc. IEEE Globecom 2006, San Francisco, CA, Nov. 27-Dec. 1, 2006.
13. D. Silva and F. R. Kschischang, "Using rank-metric codes for error correction in random network coding," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 24-29, 2007, pp. 796-800.
14. D. Silva, F. R. Kschischang, and R. Koetter, "A rankmetric approach to error control in random network coding," 2007, submitted for publication. [Online]. Available: http://arxiv.org/abs/0711.0708
15. S. Jaggi, P. Sanders, P. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, "Polynomial time algorithms for multicast network code construction," vol. 51, no. 6, pp. 1973-1982, Jun. 2005.