Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
arXiv:1301.5482 · doi:10.1109/TIT.2015.2429713
Abstract
By extending the notion of minimum rank distance, this paper introduces two new relative code parameters of a linear code C_1 of length n over a field extension and its subcode C_2. One is called the relative dimension/intersection profile (RDIP), and the other is called the relative generalized rank weight (RGRW). We 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. We propose a construction of secure network coding scheme, and analyze its security performance and error correction capability as an example of applications of the RDIP and the RGRW. Silva and Kschischang showed the existence of a secure network coding in which no part of the secret message is revealed to the adversary even if any dim C_1-1 links are wiretapped, which is guaranteed over any underlying network code. However, the explicit construction of such a scheme remained an open problem. Our new construction is just one instance of secure network coding that solves this open problem.
IEEEtran.cls, 25 pages, no figure, accepted for publication in IEEE Transactions on Information Theory
References in corpus (6)
- Properties of codes in rank metric
- MDS codes on the erasure-erasure wiretap channel
- Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers
- Secure Network Coding for Wiretap Networks of Type II
- New Parameters of Linear Codes Expressing Security Performance of Universal Secure Network Coding
- Properties of Rank Metric Codes
Cited by in corpus (20)
- Reliable and Secure Multishot Network Coding using Linearized Reed-Solomon Codes
- Relative generalized Hamming weights of one-point algebraic geometric codes
- Rank-Metric Codes and -Polymatroids
- Universal Secure Multiplex Network Coding with Dependent and Non-Uniform Messages
- Secure Network Code for Adaptive and Active Attacks with No-Randomness in Intermediate Nodes
- On defining generalized rank weights
- Secure Quantum Network Coding on Butterfly Network
- Relative generalized matrix weights of matrix codes for universal security on wire-tap networks
- Secure network code over one-hop relay network
- Reduction Theorem for Secrecy over Linear Network Code for Active Attacks
- New MRD codes from linear cutting blocking sets
- Finite-Block-Length Analysis in Classical and Quantum Information Theory
- Unifying notions of generalized weights for universal security on wire-tap networks
- On the similarities between generalized rank and Hamming weights and their applications to network coding
- About the generalized Hamming weights of matrix-product codes
- Message Randomization and Strong Security in Quantum Stabilizer-Based Secret Sharing for Classical Secrets
- On dually almost MRD codes
- Asymptotically Secure Network Code for Active Attacks and its Application to Network Quantum Key Distribution
- Secrecy and Robustness for Active Attack in Secure Network Coding and its Application to Network Quantum Key Distribution
- Generalized weights: an anticode approach