A refinement of the random coding bound

Altug, Yuucel; Wagner, Aaron B.

doi:10.1109/allerton.2012.6483281

Cited by 9 publications

(2 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When restricting to constant composition codes, we can be more explicit about the obtained prefactor, namely, f (n) = n − 1 2 (1+|E ′ sp (R)|+o(1)) (Theorem 8) 2 . Moreover, this sphere-packing bound and the best known random coding upper bound [22,23,24,25] in the classical case coincide up to the third-order term (see the discussion in Section 4)). Hence, our result yields a tight asymptotics of the sphere-packing bound for constant composition codes.…”

Section: Introductionmentioning

confidence: 52%

See 1 more Smart Citation

Quantum Sphere-Packing Bounds With Polynomial Prefactors

Cheng

Hsieh

Tomamichel

2019

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

We study lower bounds on the optimal error probability in classical coding over classicalquantum channels at rates below the capacity, commonly termed quantum sphere-packing bounds. Winter and Dalai have derived such bounds for classical-quantum channels; however, the exponents in their bounds only coincide when the channel is classical. In this paper, we show that these two exponents admit a variational representation and are related by the Golden-Thompson inequality, reaffirming that Dalai's expression is stronger in general classical-quantum channels. Second, we establish a finite blocklength sphere-packing bound for classical-quantum channels, which significantly improves Dalai's prefactor from the order of subexponential to polynomial. Furthermore, the gap between the obtained error exponent for constant composition codes and the best known classical random coding exponent vanishes in the order of o(log n/n), indicating our sphere-packing bound is almost exact in the high rate regime. Finally, for a special class of symmetric classical-quantum channels, we can completely characterize its optimal error probability without the constant composition code assumption. The main technical contributions are two converse Hoeffding bounds for quantum hypothesis testing and the saddle-point properties of error exponent functions.The distributions p ρ,σ , q ρ,σ have the same mathematical properties as the density operators ρ, σ in some cases, and thus are useful in the sequel. First, one can verify that [62,46], D α (ρ σ) = D α (p ρ,σ q ρ,σ ) , ∀α ∈ [0, 1]. 7 Throughout this paper, we skip the dependence of the channel W in the reliability function and error-exponent functions. 9 42

show abstract

Section: Introductionmentioning

confidence: 52%

“…this sphere-packing bound and the best known random coding upper bound [22,23,24,25] in the classical case coincide up to the third-order term (see the discussion in Section 4)). Hence, our result yields a tight asymptotics of the sphere-packing bound for constant composition codes.…”

Section: Introductionmentioning

confidence: 52%