• DocumentCode
    86180
  • Title

    Refinement of the Sphere-Packing Bound: Asymmetric Channels

  • Author

    Altug, Yucel ; Wagner, Aaron B.

  • Author_Institution
    Sch. of Electr. & Comput. Eng., Cornell Univ., Ithaca, NY, USA
  • Volume
    60
  • Issue
    3
  • fYear
    2014
  • fDate
    Mar-14
  • Firstpage
    1592
  • Lastpage
    1614
  • Abstract
    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-0.5(1+ε+ρR*)) for any ϵ > 0, where ρR* is the left derivative of the sphere-packing exponent at rate R and N is the blocklength.
  • Keywords
    block codes; memoryless systems; asymmetric channel; asymmetric discrete memoryless channels; constant composition codes; sphere packing bound; sphere packing exponent; Approximation methods; Channel coding; Error probability; Memoryless systems; Random variables; Testing; Vectors; Channel coding; error exponents; exact asymptotics; sub-exponential factor;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2014.2299275
  • Filename
    6730677
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=86180