ON A CLASS OF MAJORITY-LOGIC DECODABLE CYCLIC CODES

被引：43

作者：

GOETHALS, JM

DELSARTE, P

机构：

[1] Manufacture Belge de Lampes et de Materiel Electronique (MBLE), Brussels

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1968年 / 14卷 / 02期

关键词：

D O I：

10.1109/TIT.1968.1054126

中图分类号：

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

学科分类号：

0812 ;

摘要：

A new infinite class of cyclic codes is studied. Codes of this class can be decoded in a step-by-step manner, using'majority logic. Some previously known codes fall in this class, and thus admit simpler decoding procedures. As random error-correcting codes, the codes are nearly as powerful as the Bose-Chaudhuri codes. Copyright © 1968 by The Institute of Electrical and Electronics Engineers, Inc.

引用

页码：182 / +