ON THE LINEAR SPAN OF BINARY SEQUENCES OBTAINED FROM Q-ARY M-SEQUENCES, Q ODD

被引：22

作者：

CHAN, AH ^{[1
]}

GAMES, RA ^{[1
]}

机构：

[1] NORTHEASTERN UNIV,COLL COMP SCI,BOSTON,MA 02115

来源：

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

关键词：

D O I：

10.1109/18.54877

中图分类号：

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

学科分类号：

0812 ;

摘要：

A class of periodic binary sequences that are obtained from q-ary m-sequences is defined, and a general method to determine their linear spans (the length of the shortest linear recursion over the Galois field GF(2) satisfied by the sequence) is described. The results imply that the binary sequences under consideration have linear spans that are comparable with their periods, which can be made very long. One application of the results shows that the projective and affine hyperplane sequences of odd order both have full linear span. Another application involves the parity sequence of order n, which has period pn — 1, where p is an odd prime. The linear span of the parity sequence of order n is determined in terms of the linear span of a parity sequence of order 1, and this leads to an interesting open problem involving primes. © 1990 IEEE

引用

页码：548 / 552

页数：5

共 11 条

[1]

BRYNIELSSON L, 1986, LECTURE NOTES COMPUT, P156

[2]

CHAN AH, 1987, LECTURE NOTES COMPUT, P405

[3] CROSS-CORRELATION OF M-SEQUENCES AND GMW-SEQUENCES WITH THE SAME PRIMITIVE POLYNOMIAL [J].