CERTAIN GENERALIZATIONS OF CONCATENATED CODES - EXPONENTIAL ERROR-BOUNDS AND DECODING COMPLEXITY

被引：11

作者：

HIRASAWA, S

KASAHARA, M

SUGIYAMA, Y

NAMEKAWA, T

机构：

[1] MITSUBISHI ELECT CORP,DEPT COMMUN RES & DEV,COMMUN EQUIPMENT WORKS,AMAGASAKI,HYOGO 661,JAPAN

[2] OSAKA UNIV,FAC ENGN,DEPT COMMUN ENGN,SUITA,OSAKA 565,JAPAN

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1980年 / 26卷 / 05期

关键词：

D O I：

10.1109/TIT.1980.1056243

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：527 / 534

页数：8

共 10 条

[1]

BUCHER EA, 1970, IEEE T INFORM THEORY, V16, P214

[2]

Forney G. D., 1966, CONCATENATED CODES

[3]

FORNEY GD, 1974, INFORM CONTROL, V25, P222, DOI 10.1016/S0019-9958(74)90870-5

[4]

GALLAGER RG, 1968, INFORMATION THEORY R

[5] COMPLEXITY OF DECODING REED-SOLOMON CODES [J].

JUSTESEN, J .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (02) :237-238

[6]

RAMSEY JL, 1970, MIT478 RES LAB EL TE

[7] COMPLEXITY OF DECODING GOPPA CODES [J].

SARWATE, DV .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (04) :515-516

[8] COMPLEXITY OF DECODERS .2. COMPUTATIONAL WORK AND DECODING TIME [J].

SAVAGE, JE .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1971, 17 (01) :77-+

[9] A NOTE ON PERFORMANCE OF CONCATENATED CODES [J].

SAVAGE, JE .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1970, 16 (04) :512-+

[10] ERROR BOUNDS FOR CONVOLUTIONAL CODES AND AN ASYMPTOTICALLY OPTIMUM DECODING ALGORITHM [J].

VITERBI, AJ .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (02) :260-+

← 1 →