The evaluation of code noising security against the $l$-fold partial data observation in the network

A communication network with linear coding in the nodes is considered. It is assumed that an adversary can overhear data transmitted through some edges of the network and code noising is used to protect incoming information. In the paper, the security of code noising against multiple eavesdropping the network data is analysed. A formula for calculating the security against $l$ interceptions of information words is obtained. The formula is applied to the security analysis of code noising based on Reed–Muller code $\mathcal R(1,3)$.