Strong converse exponent for degraded broadcast channels at rates outside the capacity region

@article{Oohama2015StrongCE,
  title={Strong converse exponent for degraded broadcast channels at rates outside the capacity region},
  author={Yasutada Oohama},
  journal={2015 IEEE International Symposium on Information Theory (ISIT)},
  year={2015},
  pages={939-943}
}
  • Yasutada Oohama
  • Published in
    IEEE International Symposium…
    2015
  • Mathematics, Computer Science
  • We consider the discrete memoryless degraded broadcast channels. 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. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Figures from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 15 CITATIONS

    Partial strong converse for the non-degraded wiretap channel

    • Yi-Peng Wei, Sennur Ulukus
    • Mathematics, Computer Science
    • 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
    • 2016
    VIEW 7 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    A proof of the strong converse theorem for Gaussian broadcast channels via the Gaussian Poincaré inequality

    VIEW 3 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Strong Converse Theorems for Multimessage Networks with Tight Cut-Set Bound

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Strong Converse for Classical-Quantum Degraded Broadcast Channels

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Information Theory from A Functional Viewpoint

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Second-Order Converses via Reverse Hypercontractivity

    VIEW 1 EXCERPT
    CITES METHODS

    Strong converse theorems for discrete memoryless networks with tight cut-set bound

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 12 REFERENCES

    Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)

    VIEW 11 EXCERPTS
    HIGHLY INFLUENTIAL

    Source coding with side information and a converse for degraded broadcast channels

    VIEW 12 EXCERPTS
    HIGHLY INFLUENTIAL

    Error Exponents for Broadcast Channels With Degraded Message Sets

    On the converse to the coding theorem for discrete memoryless channels (Corresp.)

    • Suguru Arimoto
    • Computer Science, Mathematics
    • IEEE Trans. Inf. Theory
    • 1973
    VIEW 3 EXCERPTS