Pith. sign in

REVIEW 1 cited by

New Strong Converse for Asymmetric Broadcast Channels

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1604.02901 v4 pith:H3SEI2QX submitted 2016-04-11 cs.IT math.IT

classification cs.ITmath.IT
keywords asymmetricbroadcastchannelsapproachboundcapacityconsiderconverse
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We consider the discrete memoryless asymmetric 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Sharp Continuity of Petz and Sandwiched R\'enyi Conditional Entropies

    quant-ph 2026-08 conditional novelty 8.0 of 10

    Sharp dimension-dependent continuity moduli for Petz and sandwiched optimized conditional Rényi entropies, attained by isotropic state pairs, for alpha in [1/2,1).

Pith tools