OPTIMUM SYMBOL-BY-SYMBOL DECODING RULE FOR LINEAR CODES

被引：128

作者：

HARTMANN, CRP ^{[1
]}

RUDOLPH, LD ^{[1
]}

机构：

[1] SYRACUSE UNIV,SCH COMP & INFORMATION SCI,SYRACUSE,NY 13210

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1976年 / 22卷 / 05期

关键词：

D O I：

10.1109/TIT.1976.1055617

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：514 / 517

页数：4

共 12 条

[1]

ASSMUS EF, 1974, SIAM REV, V16, P349, DOI 10.1137/1016056

[2] OPTIMAL DECODING OF LINEAR CODES FOR MINIMIZING SYMBOL ERROR RATE [J].

BAHL, LR ;

COCKE, J ;

JELINEK, F ;

RAVIV, J .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :284-287

[3] REAL-TIME MINIMAL-BIT-ERROR PROBABILITY DECODING OF CONVOLUTIONAL CODES [J].

LEE, LN .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1974, CO22 (02) :146-151

[4]

Massey J. L., 1963, THRESHOLD DECODING

[5]

MCADAM PL, 1972, JAN IEEE INT S INF T

[6]

Peterson WW, 1972, ERROR CORRECTING COD

[7]

PETERSON WW, 1961, ERROR CORRECTING COD, P207

[8]

RUDIN W, 1967, FOURIER ANALYSIS GRO

[9] A CLASS OF MAJORITY LOGIC DECODABLE CODES [J].

RUDOLPH, LD .

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

[10] SYNDROME DECODING OF CONVOLUTIONAL CODES [J].

SCHALKWIJK, JPM ;

VINCK, AJ .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1975, CO23 (07) :789-792

← 1 2 →