EQUIVALENCE OF L-STEP ORTHOGONALIZATION AND A REED DECODING PROCEDURE

被引：4

作者：

GORE, WC

机构：

[1] Johns Hopkins University, Baltimore, Md.

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1969年 / 15卷 / 1P1期

关键词：

D O I：

10.1109/TIT.1969.1054241

中图分类号：

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

学科分类号：

0812 ;

摘要：

This correspondence shows the formal equivalence between Massey's decoding scheme called threshold decoding involving L-step orthogonalizable codes and Reed's decoding scheme originally conceived for the Muller codes. Upon examining these two decoding algorithms it is shown that each can be described in terms of a decoding logic circuit. The formal equivalence of the algorithms is proved by showing the formal equivalence of their respective decoding circuits. © 1969, IEEE. All Rights Reserved.

引用

页码：184 / +