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 条

[21] Generalized Sphere-Packing Bound for Subblock-Constrained Codes
Kiah, Han Mao
Tandon, Anshoo
Motani, Mehul
IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (01) : 187 - 199
[22] A PROOF OF SPHERE-PACKING BOUND USING CONVERSE TO CODING THEOREM
EBERT, PM
IEEE TRANSACTIONS ON INFORMATION THEORY, 1970, 16 (01) : 113 - +
[23] Optimal coding with one asymmetric error: Below the sphere packing bound
Cicalese, F
Mundici, D
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 159 - 169
[24] A sphere packing bound on Rayleigh block-fading MIMO channels
Fozunbal, M
McLaughlin, SW
Schafer, RW
2003 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5: NEW FRONTIERS IN TELECOMMUNICATIONS, 2003, : 3011 - 3015
[25] Sphere Packing Bound and Gilbert-Varshamov Bound for b-Symbol Read Channels
Song, Seunghoan
Fujiwara, Toru
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2018, E101A (11) : 1915 - 1924
[26] A sphere-packing breakthrough via dimensional families
Muses, C
APPLIED MATHEMATICS AND COMPUTATION, 1997, 83 (01) : 1 - 2
[27] SPHERE PACKING
SIGRIST, F
MATHEMATICAL INTELLIGENCER, 1983, 5 (03): : 34 - 38
[28] Sphere Packing Based on Geometric Algorithm Generation Method
Li, Y.
Ji, Shunying
PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON DISCRETE ELEMENT METHODS, 2017, 188 : 193 - 200
[29] A quasi physical method for the equal sphere packing problem
Huang, WenQi
Yu, Liang
TRUSTCOM 2011: 2011 INTERNATIONAL JOINT CONFERENCE OF IEEE TRUSTCOM-11/IEEE ICESS-11/FCST-11, 2011, : 1684 - 1690
[30] Sphere-packing Bound for Block-codes with Feedback and Finite Memory
Como, Giacomo
Nakiboglu, Baris
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 251 - 255

← 1 2 3 4 5 →