Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#235926] of Robert Calderbank

Papers Published

  1. Aggarwal, V; Sankar, L; Calderbank, AR; Poor, HV, Secrecy capacity of a class of orthogonal relay eavesdropper channels, Information Theory and Applications Workshop, ITA 2009 (2009), pp. 295-300 [doi]
    (last updated on 2018/10/22)

    The secrecy capacity is developed for a class of relay channels with orthogonal components and a passive eavesdropper node. The relay and destination receive signals from the source on two orthogonal channels such that the destination also receives transmissions from the relay on its channel. The eavesdropper can overhear either one or both of the orthogonal channels. Inner and outer bounds on the secrecy capacity are developed for both the discrete memoryless and the Gaussian channel models. For the discrete memoryless case, the secrecy capacity is shown to be achieved by a partial decode-and-forward (PDF) scheme when the eavesdropper can overhear only one of the two orthogonal channels. Two new outer bounds are presented for the Gaussian model using recent capacity results for a Gaussian multi-antenna channel with a multi-antenna eavesdropper. The outer bounds are shown to be tight for two sub-classes of channels. The first sub-class is one in which the source and relay are clustered and the eavesdropper overhears on only one of the two channels for which the PDF strategy is optimal. The second is a sub-class in which the source does not transmit to the relay for which a noise-forwarding strategy is optimal. © 2009 IEEE.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320