The Sphere Packing Bound via Augustin's Method

被引：13
|
作者：
Nakiboglu, Baris [1 ]
机构：
[1] Middle East Tech Univ, Dept Elect & Elect Engn, TR-06800 Ankara, Turkey
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2019年 / 65卷 / 02期
关键词：
Channel coding; error analysis; error probability; feedback communications; block codes; MEMORYLESS CHANNELS; RENYI DIVERGENCE; CODING THEOREM; OPTIMAL CODES; ERROR; PROBABILITY; REFINEMENT; CONVERSE; RATES;
D O I：
10.1109/TIT.2018.2882547
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A sphere packing bound (SPB) with a prefactor that is polynomial in the block length n is established for codes on a length n product channel W-[1,W- n], assuming that the maximum order 1/2 Renyi capacity among the component channels, i.e. max(t is an element of[1, n]) C-1/2, W-t, is O(ln n). The reliability function of the discrete stationary product channels with feedback is bounded from above by the sphere packing exponent. Both results are proved by first establishing a non-asymptotic SPB. The latter result continues to hold under a milder stationarity hypothesis.
引用
收藏
页码：816 / 840
页数：25
相关论文
共 50 条
  • [31] Handling Lower Bound and Hill-Climbing Strategies for Sphere Packing Problems
    Hifi, Mhand
    Yousef, Labib
    RECENT ADVANCES IN COMPUTATIONAL OPTIMIZATION: RESULTS OF THE WORKSHOP ON COMPUTATIONAL OPTIMIZATION WCO 2014, 2016, 610 : 145 - 164
  • [32] A simple derivation of the refined sphere packing bound under certain symmetry hypotheses
    Nakiboglu, Baris
    TURKISH JOURNAL OF MATHEMATICS, 2020, 44 (03) : 919 - 948
  • [33] Short Block Turbo Coded OFDM with near Sphere Packing Bound Performance
    Khalili, Fatemeh
    Dill, Jeffrey C.
    2018 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS (ICNC), 2018, : 117 - 121
  • [34] LACK OF SPHERE PACKING OF GRAPHS VIA NONLINEAR POTENTIAL THEORY
    Benjamini, Itai
    Schramm, Oded
    JOURNAL OF TOPOLOGY AND ANALYSIS, 2013, 5 (01) : 1 - 11
  • [35] On the Leech-Conway sphere packing in S(∞) space
    Marek-Crnjac, L
    CHAOS SOLITONS & FRACTALS, 2002, 14 (08) : 1305 - 1308
  • [36] FINITE SPHERE PACKING AND SPHERE COVERING
    TOTH, GF
    GRITZMANN, P
    WILLS, JM
    DISCRETE & COMPUTATIONAL GEOMETRY, 1989, 4 (01) : 19 - 40
  • [37] A Sphere Packing Bound for Vector Gaussian Fading Channels Under Peak Amplitude Constraints
    Favano, Antonino
    Ferrari, Marco
    Magarini, Maurizio
    Barletta, Luca
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (01) : 238 - 250
  • [38] A Sphere Packing Bound for AWGN MIMO Fading Channels under Peak Amplitude Constraints
    Favano, Antonino
    Ferrari, Marco
    Magarini, Maurizio
    Barletta, Luca
    2020 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,
  • [39] On performance limits of space-time codes: A sphere-packing bound approach
    Fozunbal, M
    McLaughlin, SW
    Schafer, RW
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (10) : 2681 - 2687
  • [40] A local search-based method for sphere packing problems
    Hifi, Mhand
    Yousef, Labib
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (02) : 482 - 500
12345