On the Equivalency of Reliability and Security Metrics for Wireline Networks
classification
💻 cs.IT
math.IT
keywords
equivalencysecrecyconstraintsweakclasscodingconditionsepsilon
read the original abstract
In this paper, we show the equivalency of weak and strong secrecy conditions for a large class of secure network coding problems. When we restrict to linear operations, we show the equivalency of "perfect secrecy and zero-error constraints" with "weak secrecy and $\epsilon$-error constraints".
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.