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 条
  • [21] Improving the Sphere-Packing Bound for Binary Codes over Memory less Symmetric Channels
    Mandaviani, Kaveh
    Shahidi, Shervin
    Haddadi, Shima
    Ardakani, Masoud
    Tellambura, Chintha
    2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2, 2009, : 553 - +
  • [22] A New Sphere-Packing Bound for Maximal Error Exponent for Multiple-Access Channels
    Nazari, Ali
    Pradhan, S. Sandeep
    Anastasopoulos, Achilleas
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 1513 - 1517
  • [23] Generalized Sphere Packing Bound: Basic Principles
    Fazeli, Arman
    Vardy, Alexander
    Yaakobi, Eitan
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 1256 - 1260
  • [24] SIMPLE DERIVATION OF LOWER BOUND TO RCOMP FOR DISCRETE MEMORYLESS CHANNELS
    DICK, RJ
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (05) : 595 - 596
  • [25] The Sphere Packing Bound for DSPCs With Feedback a la Augustin
    Nakiboglu, Baris
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (11) : 7456 - 7467
  • [26] The Sphere Packing Bound via Augustin's Method
    Nakiboglu, Baris
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (02) : 816 - 840
  • [27] Sphere packing lower bound on fingerprinting error probability
    Kiyavash, Negar
    Moulin, Pierre
    SECURITY, STEGANOGRAPHY, AND WATERMARKING OF MULTIMEDIA CONTENTS IX, 2007, 6505
  • [28] A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels
    Ben-Yishai, Assaf
    Kim, Young-Han
    Ordentlich, Or
    Shayevitz, Ofer
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (12) : 7639 - 7658
  • [29] Phyllotactic Description of Hard Sphere Packing in Cylindrical Channels
    Mughal, A.
    Chan, H. K.
    Weaire, D.
    PHYSICAL REVIEW LETTERS, 2011, 106 (11)
  • [30] A Tight Upper Bound for the Third-Order Asymptotics of Discrete Memoryless Channels
    Tomamichel, Marco
    Tan, Vincent Y. F.
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1536 - +
12345