DECODER MALFUNCTION IN BCH DECODERS

被引：6

作者：

SARWATE, DV

MORRISON, RD

机构：

[1] UNIV ILLINOIS,DEPT ELECT & COMP ENGN,URBANA,IL 61801

[2] ITT CORP,DIV AEROSP OPT,FT WAYNE,IN 46801

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1990年 / 36卷 / 04期

关键词：

D O I：

10.1109/18.53752

中图分类号：

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

学科分类号：

0812 ;

摘要：

A t -error-correcting bounded-distance decoder either produces the codeword nearest the received vector (if there is a codeword at distance no more than t), or indicates that no such codeword exists. However, BCH decoders based on the Peterson-Gorenstein-Zierler algorithm or the Euclidean algorithm can malfunction and produce output vectors that are not codewords at all. For any integer i no greater than t/2, if the received vector is at distance at most t— 2i from a codeword belonging to a (t - i)-error-correcting BCH supercode, then the BCH decoder output is that codeword from the supercode. © 1990 IEEE

引用

页码：884 / 889

页数：6