Networking

Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding

Free registration required

Executive Summary

Secure network coding was first introduced by Cai and Yeung, and further investigated by Feldman et al... In the scenario of secure network coding, a source node transmits n packets from n outgoing links to sink nodes through a network that implements network coding, and each sink node receives N packets from N incoming links. The authors clarify their basic properties and the relation between the RGRW and the minimum rank distance. As applications of the RDIP and the RGRW, the security performance and the error correction capability of secure network coding, guaranteed independently of the underlying network code, are analyzed and clarified.

  • Format: PDF
  • Size: 432.45 KB