6 research outputs found
Strong Converse Theorems for Degraded Broadcast Channels with Feedback
We consider the discrete memoryless degraded broadcast channels with
feedback. We prove that the error probability of decoding tends to one
exponentially for rates outside the capacity region and derive an explicit
lower bound of this exponent function. We shall demonstrate that the
information spectrum approach is quite useful for investigating this problem.Comment: Short version of this paper is accepted for presentation at ISIT
2015. arXiv admin note: substantial text overlap with arXiv:1504.0594
Partial Strong Converse for the Non-Degraded Wiretap Channel
We prove the partial strong converse property for the discrete memoryless
\emph{non-degraded} wiretap channel, for which we require the leakage to the
eavesdropper to vanish but allow an asymptotic error probability to the legitimate receiver. We show that when the transmission rate is
above the secrecy capacity, the probability of correct decoding at the
legitimate receiver decays to zero exponentially. Therefore, the maximum
transmission rate is the same for , and the partial strong
converse property holds. Our work is inspired by a recently developed technique
based on information spectrum method and Chernoff-Cramer bound for evaluating
the exponent of the probability of correct decoding