A Security Condition for Multi-Source Linear Network Coding

We obtain a necessary and sufficient condition for the security of multi-source linear network codes by studying the algebraic structure of such codes. This condition is useful for analyzing the security of such linear network codes, and it applies in cases when the random keys do not necessarily have uniform distributions. This condition also shows that the security of a linear network code does not depend on the source distribution.