ZERO ERROR CAPACITY UNDER LIST DECODING

被引：41

作者：

ELIAS, P ^{[1
]}

机构：

[1] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1988年 / 34卷 / 05期

关键词：

Information Theory--Communication Channels;

D O I：

10.1109/18.21233

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Shannon's zero-error channel capacities COF, CO with and without noiseless feedback are generalized to list decoding: the receiver lists L messages, erring if the correct one is not listed. The corresponding capacities COF(L), CO(L) are nondecreasing in L. For an I-letter input alphabet, COF (L) attains its maximum at L=I-1. A lower bound to CO(L) approaches that maximum as L increases.

引用

页码：1070 / 1074

页数：5

共 16 条

[1] CHANNEL CAPACITIES FOR LIST CODES [J].

AHLSWEDE, R .

JOURNAL OF APPLIED PROBABILITY, 1973, 10 (04) :824-836

[2]

BERLEKAMP ER, 1968, ALGEBRAIC CODING THE

[3]

Blinovskii V. M, 1986, PROBL PEREDACHI INF, V22, P11

[4]

CSISZAR I, 1981, INFORMATION THEORY C, P196

[5]

ELIAS P, 1958, Q PROGR REPORT, V48, P88

[6]

ELIAS P, 1957, WESCON CONVENTION 2, P94

[7]

GALLAGER RG, 1968, INFORMATION THEORY R

[8]

LEVIN L, 1987, COMMUNICATION SPR

[9] ON THE SHANNON CAPACITY OF A GRAPH [J].

LOVASZ, L .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (01) :1-7

[10]

MACWILLIAMS FJ, 1977, THEORY ERROR CORRECT, pCH17

← 1 2 →