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 / +

共 14 条

[1]

Bose R. C, 1960, INFROM CONTROL, V3, P68, DOI DOI 10.1016/S0019-9958(60)90287-4

[2]

CARMICHAEL RD, 1956, INTRODUCTION THEORY

[3] ON NUMBER OF INFORMATION SYMBOLS IN DIFFERENCE-SET CYCLIC CODES [J].

GRAHAM, RL ;

MACWILLIAMS, J .

BELL SYSTEM TECHNICAL JOURNAL, 1966, 45 (07) :1057-+

[4]

KASAMI T, 1966, AFCRL66622 USAF CAMB

[5]

MANN HB, 1949, ANALYSIS DESIGN EXPE

[6]

Massey J. L., 1963, THRESHOLD DECODING

[7]

MEGGITT JE, 1961, IEEE T INFORM THEORY, VIT7, P234

[8]

MULLER DE, 1954, IRE T ELECTRON COM, VEC3, P6

[9]

PETERSON WW, 1961, ERRORCORRECTING COED

[10]

Reed I., 1954, IEEE T INFORM THEORY, V4, P38

← 1 2 →