GENERALIZED THRESHOLD DECODING AND REED-SOLOMON CODES

被引：3

作者：

GORE, WC

机构：

[1] Johns Hopkins University, Baltimore, Md.

来源：

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

关键词：

D O I：

10.1109/TIT.1969.1054269

中图分类号：

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

学科分类号：

0812 ;

摘要：

A necessary condition for the existence of a set of J orthogonal parity check equations is developed, and it is demonstrated that, except for the trivial codes, the Reed-Solomon codes are not L-step orthogonalizable. Massey's concept of threshold decoding is generalized, and it is demonstrated that the Reed-Solomon codes are completely threshold decodable. Since every BCH code is a subcode of some Reed-Solomon code, every BCH code has a generalized threshold decoder. © 1969, IEEE. All Rights Reserved.

引用

页码：78 / +