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 条

[41] Random sphere packing
Blinovsky V.M.
Problems of Information Transmission, 2005, 41 (4) : 319 - 330
[42] THE SPHERE PACKING PROBLEM
HALES, TC
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1992, 44 (01) : 41 - 76
[43] Dual linear programming bounds for sphere packing via discrete reductions
Li, Rupert
ADVANCES IN MATHEMATICS, 2025, 460
[44] DUAL LINEAR PROGRAMMING BOUNDS FOR SPHERE PACKING VIA MODULAR FORMS
Cohn, Henry
Triantafillou, Nicholas
MATHEMATICS OF COMPUTATION, 2022, 91 (333) : 491 - 508
[45] Augustin's Handbook
Van Fleteren, Frederick
AUGUSTINIAN STUDIES, 2008, 39 (01) : 139 - 140
[46] A lower bound on the density of sphere packings via graph theory
Krivelevich, M
Litsyn, S
Vardy, A
INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2004, 2004 (43) : 2271 - 2279
[47] 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 - +
[48] 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
[49] High-density sphere packing for discrete element method simulations
Labra, Carlos
Onate, Eugenio
COMMUNICATIONS IN NUMERICAL METHODS IN ENGINEERING, 2009, 25 (07): : 837 - 849
[50] The sphere packing problem in dimension 8The sphere packing problem in dimension 8
Viazovska, Maryna S.
ANNALS OF MATHEMATICS, 2017, 185 (03) : 991 - 1015

← 1 2 3 4 5 →