Sphere-packing Bound for Block-codes with Feedback and Finite Memory

被引：4

作者：

Como, Giacomo ^{[1
]}

Nakiboglu, Baris ^{[2
]}

机构：

[1] MIT, Informat & Decis Syst Lab, Cambridge, MA 02139 USA

[2] MIT, Elect Res Lab, Cambridge, MA 02139 USA

来源：

2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY | 2010年

关键词：

D O I：

10.1109/ISIT.2010.5513232

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A lower bound bound is established on the error probability of fixed-length block-coding systems with finite memory feedback, which can be described in terms of a time dependent finite state machine. It is shown that the reliability function of such coding systems over discrete memoryless channels is upper-bounded by the sphere-packing exponent.

引用

页码：251 / 255

页数：5

共 7 条

[1]

Dobrushin R.L., 1962, PROBLEMY KIBERNETIKI, V8, P161

[2] Concentration Inequalities and Martingale Inequalities: A Survey [J].

Fan Chung ;

Lu, Linyuan .

INTERNET MATHEMATICS, 2006, 3 (01) :79-127

[3]

Haroutunian E., 1977, Problemy Peredachi Informatsii, P36

[4]

PALAIYANUR H, 2010, BOUND BLOCK CODES DE

[5] THE ZERO ERROR CAPACITY OF A NOISY CHANNEL [J].

SHANNON, CE .

IRE TRANSACTIONS ON INFORMATION THEORY, 1956, 2 (03) :8-19

[6] LOWER BOUNDS TO ERROR PROBABILITY FOR CODING ON DISCRETE MEMORYLESS CHANNELS .I [J].

SHANNON, CE ;

GALLAGER, RG .

INFORMATION AND CONTROL, 1967, 10 (01) :65-+

[7]

Yu Sheverdyaev A., 1982, PROBL CONTR INFORM T, V18, P5

← 1 →