DocumentCode :
1519775
Title :
On the linear span of binary sequences obtained from q-ary m-sequences, q odd
Author :
Chan, Agnes Hui ; Games, Richard A.
Author_Institution :
Mitre Corp., Bedford, MA, USA
Volume :
36
Issue :
3
fYear :
1990
fDate :
5/1/1990 12:00:00 AM
Firstpage :
548
Lastpage :
552
Abstract :
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 pm-1, where p is an odd prime. The linear span of a 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
Keywords :
binary sequences; Galois field GF(2); affine hyperplane sequences; linear span; odd order; parity sequence; periodic binary sequences; projective hyperplane sequences; q-ary m-sequences; shortest linear recursion; Binary sequences; Galois fields; Hamming weight; Polynomials; Statistics;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.54877
Filename :
54877
Link To Document :
بازگشت