4,430 research outputs found
On Approximating the Sum-Rate for Multiple-Unicasts
We study upper bounds on the sum-rate of multiple-unicasts. We approximate
the Generalized Network Sharing Bound (GNS cut) of the multiple-unicasts
network coding problem with independent sources. Our approximation
algorithm runs in polynomial time and yields an upper bound on the joint source
entropy rate, which is within an factor from the GNS cut. It
further yields a vector-linear network code that achieves joint source entropy
rate within an factor from the GNS cut, but \emph{not} with
independent sources: the code induces a correlation pattern among the sources.
Our second contribution is establishing a separation result for vector-linear
network codes: for any given field there exist networks for which
the optimum sum-rate supported by vector-linear codes over for
independent sources can be multiplicatively separated by a factor of
, for any constant , from the optimum joint entropy
rate supported by a code that allows correlation between sources. Finally, we
establish a similar separation result for the asymmetric optimum vector-linear
sum-rates achieved over two distinct fields and
for independent sources, revealing that the choice of field
can heavily impact the performance of a linear network code.Comment: 10 pages; Shorter version appeared at ISIT (International Symposium
on Information Theory) 2015; some typos correcte
Rate-Distortion-Based Physical Layer Secrecy with Applications to Multimode Fiber
Optical networks are vulnerable to physical layer attacks; wiretappers can
improperly receive messages intended for legitimate recipients. Our work
considers an aspect of this security problem within the domain of multimode
fiber (MMF) transmission. MMF transmission can be modeled via a broadcast
channel in which both the legitimate receiver's and wiretapper's channels are
multiple-input-multiple-output complex Gaussian channels. Source-channel coding
analyses based on the use of distortion as the metric for secrecy are
developed. Alice has a source sequence to be encoded and transmitted over this
broadcast channel so that the legitimate user Bob can reliably decode while
forcing the distortion of wiretapper, or eavesdropper, Eve's estimate as high
as possible. Tradeoffs between transmission rate and distortion under two
extreme scenarios are examined: the best case where Eve has only her channel
output and the worst case where she also knows the past realization of the
source. It is shown that under the best case, an operationally separate
source-channel coding scheme guarantees maximum distortion at the same rate as
needed for reliable transmission. Theoretical bounds are given, and
particularized for MMF. Numerical results showing the rate distortion tradeoff
are presented and compared with corresponding results for the perfect secrecy
case.Comment: 30 pages, 5 figures, accepted to IEEE Transactions on Communication
- …