The Sphere Packing Bound for Memoryless Channels

被引：9
|
作者：
Nakiboglu, B. [1 ]
机构：
[1] Middle East Tech Univ, Ankara, Turkey
来源：
PROBLEMS OF INFORMATION TRANSMISSION | 2020年 / 56卷 / 03期
关键词：
Augustin's method; sphere packing exponent; error exponent; reliability function; memoryless channels; Gaussian channels; Poisson channels; SIMPLE DERIVATION; ERROR; PROBABILITY; CAPACITY; REFINEMENT;
D O I：
10.1134/S0032946020030011
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Sphere packing bounds (SPBs)-with prefactors that are polynomial in the block length-are derived for codes on two families of memoryless channels using Augustin's method: (possibly nonstationary) memoryless channels with (possibly multiple) additive cost constraints and stationary memoryless channels with convex constraints on the composition (i.e., empirical distribution, type) of the input codewords. A variant of Gallager's bound is derived in order to show that these sphere packing bounds are tight in terms of the exponential decay rate of the error probability with the block length under mild hypotheses.
引用
收藏
页码：201 / 244
页数：44
相关论文
共 50 条
  • [1] The Sphere Packing Bound for Memoryless Channels
    B. Nakiboğlu
    Problems of Information Transmission, 2020, 56 : 201 - 244
  • [2] The Augustin Center and The Sphere Packing Bound For Memoryless Channels
    Nakiboglu, Baris
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 1401 - 1405
  • [3] Sphere Packing Bound for Quantum Channels
    Dalai, Marco
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012, : 160 - 164
  • [4] An improved sphere-packing bound for finite-length codes over symmetric memoryless channels
    Wiechman, Gil
    Sason, Igal
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (05) : 1962 - 1990
  • [5] An Improved Sphere-Packing Bound for Finite-Length Codes over Symmetric Memoryless Channels
    Wiechman, Gil
    Sason, Igal
    2008 INFORMATION THEORY AND APPLICATIONS WORKSHOP, 2008, : 362 - 367
  • [6] Refinement of the Sphere-Packing Bound: Asymmetric Channels
    Altug, Yuecel
    Wagner, Aaron B.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (03) : 1592 - 1614
  • [7] Sphere-Packing Bound for Classical-Quantum Channels
    Cheng, Hao-Chung
    Hsieh, Min-Hsiu
    Tomamichel, Marco
    2017 IEEE INFORMATION THEORY WORKSHOP (ITW), 2017, : 479 - 483
  • [8] Sphere-Packing Bound for Symmetric Classical-Quantum Channels
    Cheng, Hao-Chung
    Hsieh, Min-Hsiu
    Tomamichel, Marco
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 286 - 290
  • [9] Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels
    Dalai, Marco
    Winter, Andreas
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 151 - 155
  • [10] Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels
    Dalai, Marco
    Winter, Andreas
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (09) : 5603 - 5617
12345