HIGH-RATE CONVOLUTIONAL CODES WITH GOOD DISTANCE PROFILES

被引：12

作者：

HAGENAUER, J ^{[1
]}

机构：

[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598

来源：

关键词：

D O I：

10.1109/TIT.1977.1055777

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：615 / 618

页数：4

共 9 条

[1] DISTANCE AND COMPUTATION IN SEQUENTIAL DECODING [J].

CHEVILLAT, PR ;

COSTELLO, DJ .

COSTELLO, DJ .

[3]

Jelinek F., 1969, IBM Journal of Research and Development, V13, P675, DOI 10.1147/rd.136.0675

[4] ROBUSTLY OPTIMAL RATE ONE-HALF BINARY CONVOLUTIONAL CODES [J].

JOHANNESSON, R .

[5]

LIN S, 1967, IEEE T INFORM THEORY, V13, P134

PAASKE, E .

[7] AN UPPER BOUND ON THE MINIMUM DISTANCE OF A CONVOLUTIONAL CODE [J].

ROBINSON, JP .

[8]

ROBINSON JP, 1968, MAY P MIDW S CIRC TH, P598

[9] ANALYSIS OF RECURRENT CODES [J].

WYNER, AD ;

ASH, RB .