Refinement of the Sphere-Packing Bound: Asymmetric Channels

We provide a refinement of the sphere-packing bound for constant composition codes over asymmetric discrete memoryless channels that improves the subexponential factor in front of the exponent. The order of our subexponential factor is Ω(N<sup>-0.5(1+ε+ρ</sup><sup>R</sup><sup>*</sup>)) for any ϵ > 0, where ρ<sub>R</sub>* is the left derivative of the sphere… (More)

Topics

Statistics

01020201620172018
Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.