A FAST ALGORITHM TO DETERMINE THE BURST-CORRECTING LIMIT OF CYCLIC OR SHORTENED CYCLIC CODES

被引：7
作者：
DUR, A
机构：
[1] Institut für Mathematik, Universitat Innsbruck, 6020, Innsbruck
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1992年 / 38卷 / 02期
关键词：
CYCLIC CODES; BURST-CORRECTING LIMIT; BERLEKAMP-MASSEY ALGORITHM; LINEAR COMPLEXITY; INVARIANT THEORY;
D O I：
10.1109/18.119712
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A new fast algorithm is developed for computing the burst-correcting limit of a cyclic or shortened cyclic code from the parity-check polynomial of the cyclic code. The algorithm is similar to the algorithm of Matt and Massey which, up to now, has been the most efficient method to determine the burst-correcting limit of a cyclic code, but is based on apolarity of binary forms instead of linear complexity. The running times of implementations in C of both algorithms on an IBM RISC System/6000 are compared for several binary cyclic codes of practical interest. A table of the burst-correcting limit of primitive binary BCH codes of length up to 1023 is included.
引用
收藏
页码：504 / 509
页数：6
相关论文
共 12 条
[1]   OPTIMAL BURST-ERROR CORRECTING CAPABILITY OF THE CODES GENERATED BY F(X) = (XP + 1)(XQ + 1)-(X + 1) [J].
ARAZI, B .
INFORMATION AND CONTROL, 1978, 39 (03) :303-314
[2]   THE DECODING OF EXTENDED REED-SOLOMON CODES [J].
DUR, A .
DISCRETE MATHEMATICS, 1991, 90 (01) :21-40
[3]  
GRACE JH, 1903, ALGEBRA INVARIANTS
[4]  
JENKS RD, 1988, SPRINGER LNCS, V296, P12
[5]   DETERMINING THE BURST-CORRECTING LIMIT OF CYCLIC CODES - COMMENT [J].
KASAMI, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (06) :812-812
[6]  
Kernighan B. W., 1978, C PROGRAMMING LANGUA, V1st
[7]  
Lin S., 1983, PRINC MOB COMMUN
[8]  
MASSEY JL, 1969, IEEE T INFORM THEORY, V15, P122, DOI 10.1109/TIT.1969.1054260
[9]  
MASSEY JL, 1988, SPRINGER LNCS, V311, P19
[10]   DETERMINING THE BURST-CORRECTING LIMIT OF CYCLIC CODES [J].
MATT, HJ ;
MASSEY, JL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (03) :289-297
12