pith. sign in

arxiv: 1102.3002 · v3 · pith:JIE66ZZHnew · submitted 2011-02-15 · 💻 cs.IT · cs.CR· math.IT

Secure Multiplex Network Coding

classification 💻 cs.IT cs.CRmath.IT
keywords codingsecurenetworkinformationlossmultiplexrateadaptation
0
0 comments X
read the original abstract

In the secure network coding for multicasting, there is loss of information rate due to inclusion of random bits at the source node. We show a method to eliminate that loss of information rate by using multiple statistically independent messages to be kept secret from an eavesdropper. The proposed scheme is an adaptation of Yamamoto et al.'s secure multiplex coding to the secure network coding.

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.